An elementary proof of the completeness of PDL
From MaRDI portal
Cites work
- A practical decision method for propositional dynamic logic (preliminary report)
- scientific article; zbMATH DE number 3686774 (Why is no real title available?)
- scientific article; zbMATH DE number 3607998 (Why is no real title available?)
- Propositional dynamic logic of regular programs
- Sequential method in propositional dynamic logic
Cited in
(56)- Strong completeness and limited canonicity for PDL
- Dynamic topological S5
- Process logic with regular formulas
- PDL with data constants
- A logic to reason about likelihood
- Automata-theoretic techniques for modal logics of programs
- Concurrent program schemes and their logics
- Process logic: Expressiveness, decidability, completeness
- On models for propositional dynamic logic
- A guide to completeness and complexity for modal logics of knowledge and belief
- Dynamic linear time temporal logic
- Computation paths logic: An expressive, yet elementary, process logic
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
- Deterministic propositional dynamic logic: finite models, complexity, and completeness
- Dynamic Łukasiewicz logic and its application to immune system
- Adding proof calculi to epistemic logics with structured knowledge
- Reasoning in large games with unboundedly many players
- Dynamic Łukasiewicz logic and dynamic MV-algebras
- Epistemic GDL: a logic for representing and reasoning about imperfect information games
- Sequential dynamic logic
- Decision procedures and expressiveness in the temporal logic of branching time
- An exercise on the generation of many-valued dynamic logics
- Finite models constructed from canonical formulas
- Tableaux for constructive concurrent dynamic logic
- The logic of public announcements, common knowledge, and private suspicions
- Reasoning with protocols under imperfect information
- Propositional Dynamic Logic as a Logic of Belief Revision
- Expressivity and completeness for public update logics via reduction axioms
- Action emulation
- Computation paths logic: an expressive, yet elementary, process logic
- Structures of oppositions in public announcement logic
- Weak completeness of coalgebraic dynamic logics
- A canonical model construction for iteration-free PDL with intersection
- Semantic Foundations for Deterministic Dataflow and Stream Processing
- Dynamic epistemic logics
- Axiomatization and computability of a variant of iteration-free PDL with fork
- Mechanising Gödel-Löb provability logic in HOL light
- A Leibnizian Logic of Possible Laws
- On the complexity of Kleene algebra with domain
- The language of social software
- Completeness for flat modal fixpoint logics
- Automated temporal reasoning about reactive systems
- Filtration and canonical completeness for continuous modal \(\mu\)-calculi
- A categorical approach to coalgebraic fixpoint logic
- Games for the -calculus
- Implicit quantification for modal reasoning in large games
- Modal logics with intersection modality
- Dynamic topological logic
- Morita rigidity for Kleene algebras
- A complete propositional dynamic logic for regular expressions with lookahead
- Constructive modal logics. I
- The propositional dynamic logic of deterministic, well-structured programs
- Results on the propositional \(\mu\)-calculus
- Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)
- An essay in combinatory dynamic logic
- Subject-oriented spatial logic
This page was built for publication: An elementary proof of the completeness of PDL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1147690)
