Pages that link to "Item:Q792083"
From MaRDI portal
The following pages link to Propositional dynamic logic of nonregular programs (Q792083):
Displaying 22 items.
- A note on definability in fragments of arithmetic with free unary predicates (Q365661) (← links)
- Collapsing probabilistic hierarchies. I (Q384407) (← links)
- Branching-time logics with path relativisation (Q386037) (← links)
- Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\) (Q801901) (← links)
- Propositional dynamic logic of context-free programs and fixpoint logic with chop (Q845832) (← links)
- A note on an extension of PDL (Q959057) (← links)
- Communication in concurrent dynamic logic (Q1095653) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- Programming in metric temporal logic (Q1128978) (← links)
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs (Q1311976) (← links)
- A theory of timed automata (Q1322162) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- The price of universality (Q1815426) (← links)
- Temporal logic with recursion (Q2051830) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- Model checking propositional dynamic logic with all extras (Q2494725) (← links)
- Propositional dynamic logic with recursive programs (Q2643333) (← links)
- Classes of Timed Automata and the Undecidability of Universality (Q2842589) (← links)
- PROPOSITIONAL DYNAMIC LOGIC FOR REASONING ABOUT FIRST-CLASS AGENT INTERACTION PROTOCOLS (Q3224882) (← links)
- Propositional Dynamic Logic with Program Quantifiers (Q5415640) (← links)
- Products of ‘transitive” modal logics (Q5718700) (← links)
- Temporal Logic with Recursion. (Q6060093) (← links)
