Propositional dynamic logic of context-free programs and fixpoint logic with chop

This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former. This relationship transfers several decidability and complexity results between the two logics. Key words: Program Logics, Context-Free Languages,

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Martin Lange, Rafal Somla
• Keywords: IPL 2006, Logics, Non-regular Programs, Propositional Dynamic Logic