An essay in combinatory dynamic logic

DOI10.1016/0890-5401(91)90026-XzbMATH Open0732.03021OpenAlexW2064773636MaRDI QIDQ809068FDOQ809068

Authors: Solomon Passy, Tinko Tinchev 

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

Recommendations

• scientific article; zbMATH DE number 3924749
• Concurrent dynamic logic
• PDL with data constants
• scientific article; zbMATH DE number 139632
• scientific article; zbMATH DE number 4010497

zbMATH Keywords

quantificationcompletenessdecidabilitysoundnesschoice functionfinite model propertyCombinatory Propositional Dynamic Logicextensions of CPDLfinitary axiomatizationStone representation theorem for combinatory dynamic algebras

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (48)

• Model checking hybrid logics (with an application to semistructured data)
• A foray into combinatory logic
• Arthur Prior and hybrid logic
• Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
• Complete Axiomatization of a Relative Modal Logic with Composition and Intersection
• A fragment of intuitionistic dynamic logic
• A PDL approach for qualitative velocity
• Remarks on Gregory's ``actually operator
• A Hybrid Public Announcement Logic with Distributed Knowledge
• Notes on logics of metric spaces
• PDL with negation of atomic programs
• Model Checking Strategic Equilibria
• A system of dynamic modal logic
• Infinitary propositional normal modal logic
• The many faces of counts-as: A formal analysis of constitutive rules
• Hyperboolean Algebras and Hyperboolean Modal Logic
• Converse-PDL with regular inclusion axioms: a framework for MAS logics
• A simple tableau system for the logic of elsewhere
• A Qualitative Theory of Cognitive Attitudes and their Change
• Repairing the interpolation theorem in quantified modal logic
• Encoding hybridized institutions into first-order logic
• Title not available (Why is that?)
• The Fitch-Church paradox and first order modal logic
• Correctness and worst-case optimality of Pratt-style decision procedures for modal and hybrid logics
• An essay in combinatory dynamic logic
• Clausal tableaux for hybrid PDL
• A modal perspective on the computational complexity of attribute value grammar
• A study on multi-dimensional products of graphs and hybrid logics
• Hybrid languages
• Understanding the Brandenburger-Keisler paradox
• Birkhoff style calculi for hybrid logics
• Deterministic SQEMA and application for pre-contact logic
• Model checking for hybrid logic
• Pure extensions, proof rules, and hybrid axiomatics
• Introducing \(H\), an institution-based formal specification and verification language
• Obligation as weakest permission: a strongly complete axiomatization
• Modal logic with names
• Towards a hybrid dynamic logic for hybrid dynamic systems
• Foundations of logic programming in hybrid logics with user-defined sharing
• A canonical model construction for iteration-free PDL with intersection
• Temporal Logics with Reference Pointers and Computation Tree Logics
• Determinism and looping in combinatory PDL
• PDL with intersection of programs: a complete axiomatization
• ``That will do: logics of deontic necessity and sufficiency
• Hybrid logics: Characterization, interpolation and complexity
• Parametrized modal logic. II: The unidimensional case
• On the undecidability of logics with converse, nominals, recursion and counting
• Logical Interpolation and Projection onto State in the Duration Calculus

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809068)