Pages that link to "Item:Q1258296"
From MaRDI portal
The following pages link to Propositional dynamic logic of regular programs (Q1258296):
Displaying 50 items.
- On combinations of propositional dynamic logic and doxastic modal logics (Q1006486) (← links)
- Polyadic dynamic logics for HPSG parsing (Q1016030) (← links)
- A multiprocess network logic with temporal and spatial modalities (Q1058846) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- Propositional dynamic logic with local assignments (Q1062972) (← links)
- A probabilistic PDL (Q1063584) (← links)
- PDL with data constants (Q1065545) (← links)
- The semantics of Hoare's iteration rule (Q1078551) (← links)
- A logic to reason about likelihood (Q1090326) (← links)
- Automata-theoretic techniques for modal logics of programs (Q1090675) (← links)
- Concurrent program schemes and their logics (Q1094866) (← links)
- Communication in concurrent dynamic logic (Q1095653) (← links)
- Interpreting logics of knowledge in propositional dynamic logic (Q1096609) (← links)
- Succinct representation of regular sets using gotos and Boolean variables (Q1101207) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- A finite model theorem for the propositional \(\mu\)-calculus (Q1117213) (← links)
- An arithmetical hierarchy in propositional dynamic logic (Q1119628) (← links)
- An automata theoretic decision procedure for the propositional mu- calculus (Q1119630) (← links)
- An elementary proof of the completeness of PDL (Q1147690) (← links)
- Propositional dynamic logic is weaker without tests (Q1156482) (← links)
- Process logic: Expressiveness, decidability, completeness (Q1168965) (← links)
- On the computational complexity of satisfiability in propositional logics of programs (Q1170028) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- On models for propositional dynamic logic (Q1183594) (← links)
- Dynamic algebras: Examples, constructions, applications (Q1189900) (← links)
- A model checker for linear time temporal logic (Q1192606) (← links)
- A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476) (← links)
- Getting started: Beginnings in the logic of action (Q1207426) (← links)
- Dynamic linear time temporal logic (Q1295431) (← links)
- Computation paths logic: An expressive, yet elementary, process logic (Q1295436) (← links)
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs (Q1311976) (← links)
- A modal perspective on the computational complexity of attribute value grammar (Q1314274) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- Complexity results for two-way and multi-pebble automata and their logics (Q1349896) (← links)
- The complexity of PDL with interleaving (Q1351943) (← links)
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Q1377625) (← links)
- Modeling belief in dynamic systems. I: Foundations (Q1389534) (← links)
- Program schemata vs. automata for decidability of program logics (Q1392141) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- Complexity of some problems in positive and related calculi (Q1401362) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Symbolic model checking for \(\mu\)-calculus requires exponential time (Q1575656) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- On the completeness of propositional Hoare logic (Q1602554) (← links)
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs (Q1643142) (← links)
- Finite-trace linear temporal logic: coinductive completeness (Q1667649) (← links)
- On the complexity of input/output logic (Q1688711) (← links)
- Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs (Q1701681) (← links)
- Interactions between knowledge, action and commitment within agent dynamic logic (Q1770620) (← links)
- About cut elimination for logics of common knowledge (Q1772772) (← links)
