An essay in combinatory dynamic logic

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

Tinko Tinchev, Solomon Passy

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0890-5401(91)90026-x

zbMATH Keywords

quantificationcompletenessdecidabilitychoice functionfinite model propertysoundnessCombinatory Propositional Dynamic Logicextensions of CPDLfinitary axiomatizationStone representation theorem for combinatory dynamic algebras

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (43)

Foundations of logic programming in hybrid logics with user-defined sharing ⋮ Hyperboolean Algebras and Hyperboolean Modal Logic ⋮ The Fitch-Church paradox and first order modal logic ⋮ Infinitary propositional normal modal logic ⋮ Arthur Prior and hybrid logic ⋮ Pure extensions, proof rules, and hybrid axiomatics ⋮ Hybrid languages ⋮ Notes on logics of metric spaces ⋮ Introducing \(H\), an institution-based formal specification and verification language ⋮ Birkhoff style calculi for hybrid logics ⋮ A Qualitative Theory of Cognitive Attitudes and their Change ⋮ Unnamed Item ⋮ Repairing the interpolation theorem in quantified modal logic ⋮ ``That will do: logics of deontic necessity and sufficiency ⋮ Unnamed Item ⋮ Determinism and looping in combinatory PDL ⋮ A study on multi-dimensional products of graphs and hybrid logics ⋮ The many faces of counts-as: A formal analysis of constitutive rules ⋮ A PDL APPROACH FOR QUALITATIVE VELOCITY ⋮ Understanding the Brandenburger-Keisler paradox ⋮ Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics ⋮ A simple tableau system for the logic of elsewhere ⋮ A Hybrid Public Announcement Logic with Distributed Knowledge ⋮ Hybrid logics: characterization, interpolation and complexity ⋮ Encoding hybridized institutions into first-order logic ⋮ OBLIGATION AS WEAKEST PERMISSION: A STRONGLY COMPLETE AXIOMATIZATION ⋮ Model checking hybrid logics (with an application to semistructured data) ⋮ Model Checking Strategic Equilibria ⋮ Temporal Logics with Reference Pointers and Computation Tree Logics ⋮ A system of dynamic modal logic ⋮ Clausal Tableaux for Hybrid PDL ⋮ PDL with intersection of programs: a complete axiomatization ⋮ Logical Interpolation and Projection onto State in the Duration Calculus ⋮ PDL with negation of atomic programs ⋮ Model checking for hybrid logic ⋮ Modal logic with names ⋮ Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems ⋮ A modal perspective on the computational complexity of attribute value grammar ⋮ Complete Axiomatization of a Relative Modal Logic with Composition and Intersection ⋮ An essay in combinatory dynamic logic ⋮ Omitting types theorem in hybrid dynamic first-order logic with rigid symbols ⋮ On the undecidability of logics with converse, nominals, recursion and counting ⋮ Remarks on Gregory's ``actually operator

Cites Work

• 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
• 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

This page was built for publication: An essay in combinatory dynamic logic