Pages that link to "Item:Q1147690"
From MaRDI portal
The following pages link to An elementary proof of the completeness of PDL (Q1147690):
Displaying 50 items.
- Action emulation (Q375313) (← links)
- The language of social software (Q625718) (← links)
- Completeness for flat modal fixpoint logics (Q638475) (← links)
- Games for the \(\mu\)-calculus (Q671352) (← links)
- Dynamic topological logic (Q705534) (← links)
- Constructive modal logics. I (Q750417) (← links)
- The propositional dynamic logic of deterministic, well-structured programs (Q801682) (← links)
- Results on the propositional \(\mu\)-calculus (Q801893) (← links)
- Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\) (Q801901) (← links)
- An essay in combinatory dynamic logic (Q809068) (← links)
- Subject-oriented spatial logic (Q821569) (← links)
- Strong completeness and limited canonicity for PDL (Q1006490) (← links)
- Dynamic topological S5 (Q1024554) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- PDL with data constants (Q1065545) (← 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)
- Process logic: Expressiveness, decidability, completeness (Q1168965) (← links)
- On models for propositional dynamic logic (Q1183594) (← links)
- A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476) (← links)
- Dynamic linear time temporal logic (Q1295431) (← links)
- Computation paths logic: An expressive, yet elementary, process logic (Q1295436) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Deterministic propositional dynamic logic: finite models, complexity, and completeness (Q1839245) (← links)
- Dynamic Łukasiewicz logic and its application to immune system (Q2100245) (← links)
- Adding proof calculi to epistemic logics with structured knowledge (Q2145260) (← links)
- Reasoning in large games with unboundedly many players (Q2148813) (← links)
- Dynamic Łukasiewicz logic and dynamic MV-algebras (Q2206432) (← links)
- Epistemic GDL: a logic for representing and reasoning about imperfect information games (Q2238622) (← links)
- Sequential dynamic logic (Q2255197) (← links)
- Decision procedures and expressiveness in the temporal logic of branching time (Q2265816) (← links)
- An exercise on the generation of many-valued dynamic logics (Q2374313) (← links)
- Finite models constructed from canonical formulas (Q2462682) (← links)
- Tableaux for constructive concurrent dynamic logic (Q2488268) (← links)
- The Logic of Public Announcements, Common Knowledge, and Private Suspicions (Q2971701) (← links)
- REASONING WITH PROTOCOLS UNDER IMPERFECT INFORMATION (Q3096821) (← links)
- Propositional Dynamic Logic as a Logic of Belief Revision (Q3511454) (← links)
- Expressivity and completeness for public update logics via reduction axioms (Q3647272) (← links)
- Computation paths logic: An expressive, yet elementary, process logic (Q4571972) (← links)
- Structures of Oppositions in Public Announcement Logic (Q4915594) (← links)
- (Q5014445) (← links)
- (Q5015273) (← links)
- Semantic Foundations for Deterministic Dataflow and Stream Processing (Q5041103) (← links)
- Dynamic Epistemic Logics (Q5249670) (← links)
- Axiomatization and computability of a variant of iteration-free PDL with fork (Q5918208) (← links)
- Mechanising Gödel-Löb provability logic in HOL light (Q6050769) (← links)
- A Leibnizian Logic of Possible Laws (Q6107286) (← links)
- Automated temporal reasoning about reactive systems (Q6560389) (← links)
- Filtration and canonical completeness for continuous modal \(\mu\)-calculi (Q6649525) (← links)
