An essay in combinatory dynamic logic

DOI10.1016/0890-5401(91)90026-XzbMath0732.03021MaRDI QIDQ809068

Tinko Tinchev, Solomon Passy

Publication date: 1991

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

quantification; completeness; decidability; choice function; finite model property; soundness; Combinatory Propositional Dynamic Logic; extensions of CPDL; finitary axiomatization; Stone representation theorem for combinatory dynamic algebras

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03B70: Logic in computer science

03B40: Combinatory logic and lambda calculus

Related Items

Temporal Logics with Reference Pointers and Computation Tree Logics, Hyperboolean Algebras and Hyperboolean Modal Logic, An essay in combinatory dynamic logic, On the undecidability of logics with converse, nominals, recursion and counting, Arthur Prior and hybrid logic, Pure extensions, proof rules, and hybrid axiomatics, Notes on logics of metric spaces, Determinism and looping in combinatory PDL, The many faces of counts-as: A formal analysis of constitutive rules, Infinitary propositional normal modal logic, A system of dynamic modal logic, Modal logic with names, A modal perspective on the computational complexity of attribute value grammar, Repairing the interpolation theorem in quantified modal logic, Remarks on Gregory's ``actually operator, Hybrid languages, Understanding the Brandenburger-Keisler paradox, Model checking hybrid logics (with an application to semistructured data), Hybrid logics: characterization, interpolation and complexity, Model Checking Strategic Equilibria, Complete Axiomatization of a Relative Modal Logic with Composition and Intersection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nominal tense logic
• The propositional dynamic logic of deterministic, well-structured programs
• An essay in combinatory dynamic logic
• Modal definability in enriched languages
• Determinism and looping in combinatory PDL
• DAL -- a logic for data analysis
• Handbook of philosophical logic. Volume II: Extensions of classical logic
• Propositional dynamic logic with local assignments
• PDL with data constants
• Graded modalities. I
• The modal logic of `all and only'
• Infinitary propositional normal modal logic
• Descriptively complete process logic
• The unaxiomatizability of a quantified intensional logic
• An elementary proof of the completeness of PDL
• Axiomatising the logic of computer programming
• A complete logic for reasoning about programs via nonstandard model theory. II
• Inaccessible worlds
• Investigations in modal and tense logics with applications to problems in philosophy and linguistics
• First-order dynamic logic
• Deterministic propositional dynamic logic: finite models, complexity, and completeness
• Normal forms in modal logic
• Modality and quantification in S5
• A completeness theorem in modal logic
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Propositional dynamic logic of looping and converse is elementarily decidable
• Concurrent dynamic logic
• Using the Universal Modality: Gains and Questions
• Propositional quantifiers in modal logic1
• An approach to tense logic¹
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Boolean Algebras with Operators. Part I
• Two-dimensional modal logic