Propositional Dynamic Logic with Program Quantifiers

DOI10.1016/j.entcs.2008.10.014zbMath1286.03119OpenAlexW1965560439MaRDI QIDQ5415640

Daniel Leivant

Publication date: 13 May 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.10.014

zbMATH Keywords

\(\mu\)PDLpropositional dynamic logic with program quantificationQPDL

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (4)

Propositional dynamic logic with quantification over regular computation sequences ⋮ Second-order propositional modal logic and monadic alternation hierarchies ⋮ Monadic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Σ</mml:mi><mml:mn>1</mml:mn><mml:mn>1</mml:mn></mml:msubsup></mml:math> and Modal Logic with Quantified Binary Relations ⋮ Existential second-order logic and modal logic with quantified accessibility relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propositional dynamic logic of nonregular programs
• Results on the propositional \(\mu\)-calculus
• The complementation problem for Büchi automata with applications to temporal logic
• Program schemata vs. automata for decidability of program logics
• Deciding Properties of Nonregular Programs
• Complete Proof System for QPTL

This page was built for publication: Propositional Dynamic Logic with Program Quantifiers