Mathematical modal logic: A view of its evolution

DOI10.1016/S1570-8683(03)00008-9zbMath1041.03015MaRDI QIDQ1422628

Robert Goldblatt

Publication date: 24 February 2004

Published in: Journal of Applied Logic (Search for Journal in Brave)

zbMATH Keywords

surveymodal logicKripke semanticsBoolean algebras with operatorshistory of logic

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Modal logic (including the logic of norms) (03B45) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) History of mathematical logic and foundations (03-03)

Related Items

Finite-trace linear temporal logic: coinductive completeness ⋮ Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition ⋮ Knowledge means ‘all’, belief means ‘most’ ⋮ Unnamed Item ⋮ Willem Blok and modal logic ⋮ Algebraic models of deviant modal operators based on De Morgan and Kleene lattices ⋮ Possible worlds in use ⋮ Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms ⋮ Modes of adjointness ⋮ MacNeille completions and canonical extensions ⋮ Canonical extensions: an algebraic approach to Stone duality ⋮ Multimodal Separation Logic for Reasoning About Operational Semantics ⋮ Intuitionistic epistemic logic, Kripke models and Fitch's paradox ⋮ Erdős Graphs Resolve Fine's Canonicity Problem ⋮ Proof Complexity of Non-classical Logics ⋮ Lattices with Interior and Closure Operators and Abstract Approximation Spaces ⋮ Decidability: theorems and admissible rules ⋮ COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS ⋮ Topological Semantics for da Costa Paraconsistent Logics $$C_\omega $$ C ω and $$C^{*}_\omega $$ C ω ∗ ⋮ Validity and necessity ⋮ On the Blok-Esakia Theorem ⋮ Constructive Modalities with Provability Smack

Cites Work

• On Some Completeness Theorems in Modal Logic
• Incompleteness of semantics for intermediate predicate logics, I. Kripke's Semantics
• A note on modal formulae and relational properties
• First-order definability in modal logic
• The inadequacy of the neighbourhood semantics for modal logic
• Reduction of tense logic to modal logic. I
• Reduction of second‐order logic to modal logic
• Categories of frames for modal logic
• The logical consequence relation of propositional tense logic
• A Neighbourhood Frame for T with No Equivalent Relational Frame
• Modal formulas are either elementary or not ΣΔ-elementary
• Reduction of tense logic to modal logic II
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Two simple incomplete modal logics
• Arithmetical necessity, provability and intuitionistic logic
• Computational types from a logical perspective
• The Complexity of Tree Automata and Logics of Programs
• Algebraic polymodal logic: a survey
• A new proof of Sahlqvist's theorem on modal definability and completeness
• An incomplete logic containing S4
• An incompleteness theorem in modal logic
• Metamathematics of modal logic
• An algebraic study of Diodorean modal systems
• Algebraic semantics for modal logics I
• That All Normal Extensions of S4.3 Have the Finite Model Property
• An algebraic study of tense logics with linear time
• Algebras Whose Congruence Lattices are Distributive.
• Modal Logics Between S 4 and S 5
• An axiomatic basis for computer programming
• Note on a paper in tense logic
• A normal modal calculus between T and S4 without the finite model property
• Some relational systems and the associated topological spaces
• Decidability of Second-Order Theories and Automata on Infinite Trees
• A generalisation of the concept of a relational model for modal logic¹
• The Logics Containing S 4.3
• Modal logics with linear alternative relations
• Semantic analysis of tense logics
• The complexity of theorem-proving procedures
• Noncompactness in propositional modal logic
• Equational Bases and Nonmodular Lattice Varieties
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• A NOTE ON THE MODAL CALCULI S 4.2 AND S 4.3
• Topological representations of distributive lattices and Brouwerian logics
• Algebraic postulates and a geometric interpretation for the Lewis calculus of strict implication
• The problem of interpreting modal logic
• The completeness of the first-order functional calculus
• Some theorems about the sentential calculi of Lewis and Heyting
• Completeness in the theory of types
• Extensions of the Lewis system S5
• Boolean Algebras with Operators. Part I
• Boolean Algebras with Operators
• The elimination theorem when modality is present
• Modal logics for communicating systems
• Modal logics for mobile processes
• Notions of computation and monads
• The temporal logic of branching time
• Propositional dynamic logic of nonregular programs
• Modal logics of domains on the real plane
• Results on the propositional \(\mu\)-calculus
• Proof systems for satisfiability in Hennessy-Milner logic with recursion
• Calculi for synchrony and asynchrony
• On powerdomains and modality
• An incomplete system of modal logic
• Self-reference and modal logic
• A finite model theorem for the propositional \(\mu\)-calculus
• An automata theoretic decision procedure for the propositional mu- calculus
• Descriptively complete process logic
• A near-optimal method for reasoning about action
• The temporal semantics of concurrent programs
• A calculus of communicating systems
• Application of modal logic to programming
• Diodorean modality in Minkowski spacetime
• Some kinds of modal completeness
• Modal operators on Heyting algebras
• Decidability and the finite model property
• Process logic: Expressiveness, decidability, completeness
• Provability: The emergence of a mathematical modality
• A guide to completeness and complexity for modal logics of knowledge and belief
• An extension of S4 complete for the neighbourhood semantics but incomplete for the relational semantics
• Provability interpretations of modal logic
• Investigations in modal and tense logics with applications to problems in philosophy and linguistics
• First-order dynamic logic
• Propositional dynamic logic of regular programs
• Tools and techniques in modal logic
• Modal logics and varieties of modal algebras: The Beth properties, interpolation, and amalgamation
• CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
• On the canonicity of Sahlqvist identities
• Sahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebras
• Propositional lax logic
• Multi-dimensional modal logic
• Model theory
• Duality between modal algebras and neighbourhood frames
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• A modal logic for message passing processes
• Elementary generation and canonicity for varieties of Boolean algebras with operators
• Decision procedures and expressiveness in the temporal logic of branching time
• Remarks about axiomatizations of certain modal systems
• A Henkin completeness theorem for T
• Relationships between nondeterministic and deterministic tape complexities
• Some embedding theorems for modal logic
• The completeness of S1 and some related systems
• Pragmatics and intensional logic
• On decidable, finitely axiomatizable, modal and tense logics without the finite model property. I, II
• Normal forms in modal logic
• Solution to a completeness problem of Lemmon and Scott
• Varieties of complex algebras
• An essay in modal logic
• The algebra of topology
• On closed elements in closure algebras
• A remark on functionally free algebras
• A lattice-theoretical fixpoint theorem and its applications
• The Russell–Prawitz modality
• Quasi-Modal Equivalence of Canonical Structures
• An axiomatization of full Computation Tree Logic
• Solution of a problem of Leon Henkin
• Modality and quantification in S5
• New foundations for Lewis modal systems
• The Morning Star Paradox
• A completeness theorem in modal logic
• Temporal logic can be more expressive
• Propositional dynamic logic of looping and converse is elementarily decidable
• An incomplete decidable modal logic
• “Sometimes” and “not never” revisited
• Algebraic laws for nondeterminism and concurrency
• The Undecidability of Monadic Modal Quantification Theory
• The lattice of modal logics: an algebraic investigation
• Syntactic aspects of modal incompleteness theorems
• Grothendieck Topology as Geometric Modality
• The McKinsey axiom is not canonical
• Modal Operators, Equivalence Relations, and Projective Algebras
• Subdirect unions in universal algebra
• Projective Algebra I
• Modalities and Quantification
• On the syntactical construction of systems of modal logic
• The preservation of Sahlqvist equations in completions of Boolean algebras with operators
• 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
• 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