The following pages link to PDL with data constants (Q1065545):
Displaying 20 items.
- Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\) (Q801901) (← links)
- An essay in combinatory dynamic logic (Q809068) (← links)
- On the undecidability of logics with converse, nominals, recursion and counting (Q814615) (← links)
- Determinism and looping in combinatory PDL (Q921968) (← links)
- The many faces of counts-as: A formal analysis of constitutive rules (Q931777) (← links)
- Propositional dynamic logic with local assignments (Q1062972) (← links)
- Infinitary propositional normal modal logic (Q1102267) (← 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)
- The complexity of PDL with interleaving (Q1351943) (← links)
- Hybrid languages (Q1909610) (← links)
- Towards reasoning about Hoare relations (Q1924753) (← links)
- A propositional logic of Boolean recursive programs in which predicate variables appear in conditions (Q2639846) (← links)
- Clausal tableaux for hybrid PDL (Q2825411) (← links)
- PDL with intersection of programs: a complete axiomatization (Q3643256) (← links)
- PDL with negation of atomic programs (Q3647227) (← links)
- Derivation rules as anti-axioms in modal logic (Q4276034) (← links)
- PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic (Q4635816) (← links)
- (Q4994195) (← links)
- Automated Reasoning (Q5307064) (← links)
