An elementary proof of the completeness of PDL
From MaRDI portal
Publication:1147690
DOI10.1016/0304-3975(81)90019-0zbMath0451.03006OpenAlexW1988903622MaRDI QIDQ1147690
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(81)90019-0
Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)
Related Items
Subject-oriented spatial logic ⋮ Semantic Foundations for Deterministic Dataflow and Stream Processing ⋮ A logic to reason about likelihood ⋮ Automata-theoretic techniques for modal logics of programs ⋮ An exercise on the generation of many-valued dynamic logics ⋮ Concurrent program schemes and their logics ⋮ Adding proof calculi to epistemic logics with structured knowledge ⋮ Reasoning in large games with unboundedly many players ⋮ Action emulation ⋮ Mechanising Gödel-Löb provability logic in HOL light ⋮ A Leibnizian Logic of Possible Laws ⋮ The language of social software ⋮ Propositional Dynamic Logic as a Logic of Belief Revision ⋮ On the complexity of Kleene algebra with domain ⋮ Completeness for flat modal fixpoint logics ⋮ Dynamic Łukasiewicz logic and dynamic MV-algebras ⋮ The Logic of Public Announcements, Common Knowledge, and Private Suspicions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Process logic: Expressiveness, decidability, completeness ⋮ On models for propositional dynamic logic ⋮ Finite models constructed from canonical formulas ⋮ Games for the \(\mu\)-calculus ⋮ Epistemic GDL: a logic for representing and reasoning about imperfect information games ⋮ A guide to completeness and complexity for modal logics of knowledge and belief ⋮ Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics ⋮ Structures of Oppositions in Public Announcement Logic ⋮ Sequential dynamic logic ⋮ Tableaux for constructive concurrent dynamic logic ⋮ Dynamic topological logic ⋮ Decision procedures and expressiveness in the temporal logic of branching time ⋮ Axiomatization and computability of a variant of iteration-free PDL with fork ⋮ Strong completeness and limited canonicity for PDL ⋮ Constructive modal logics. I ⋮ Dynamic topological S5 ⋮ REASONING WITH PROTOCOLS UNDER IMPERFECT INFORMATION ⋮ Expressivity and completeness for public update logics via reduction axioms ⋮ Computation paths logic: An expressive, yet elementary, process logic ⋮ Deterministic propositional dynamic logic: finite models, complexity, and completeness ⋮ Dynamic linear time temporal logic ⋮ Computation paths logic: An expressive, yet elementary, process logic ⋮ Dynamic Epistemic Logics ⋮ Dynamic Łukasiewicz logic and its application to immune system ⋮ Process logic with regular formulas ⋮ 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\}\) ⋮ PDL with data constants ⋮ An essay in combinatory dynamic logic
Cites Work
