Propositional dynamic logic with program quantifiers
From MaRDI portal
Recommendations
Cites work
- Complete Proof System for QPTL
- Deciding Properties of Nonregular Programs
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3732007 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- Program schemata vs. automata for decidability of program logics
- Propositional dynamic logic of nonregular programs
- Results on the propositional \(\mu\)-calculus
- The complementation problem for Büchi automata with applications to temporal logic
Cited in
(16)- Propositional dynamic logic with local assignments
- PDL with data constants
- Propositional dynamic logic with quantification over regular computation sequences
- Existential second-order logic and modal logic with quantified accessibility relations
- scientific article; zbMATH DE number 1696783 (Why is no real title available?)
- Monadic \(\Sigma^{1}_{1}\) and modal logic with quantified binary relations
- scientific article; zbMATH DE number 3845549 (Why is no real title available?)
- scientific article; zbMATH DE number 3859091 (Why is no real title available?)
- scientific article; zbMATH DE number 3935012 (Why is no real title available?)
- On static logics, dynamic logics, and complexity classes
- Second-order propositional modal logic and monadic alternation hierarchies
- scientific article; zbMATH DE number 7317262 (Why is no real title available?)
- Automata, Languages and Programming
- Separating the expressive power of propositional dynamic and modal fixpoint logics
- A dynamic logic for QASM programs
- Propositional dynamic logic of context-free programs and fixpoint logic with chop
This page was built for publication: Propositional dynamic logic with program quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5415640)