COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
DOI10.1017/S1755020317000259WikidataQ127574931 ScholiaQ127574931MaRDI QIDQ5241231
Tadeusz Litak, Wesley H. Holliday
Publication date: 30 October 2019
Published in: The Review of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.07542
modal logicprovability logicincompletenessBoolean algebras with operatorsconservativitycompletely additive operatorsBlok dichotomy
Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Related Items
Uses Software
Cites Work
- Ultraproducts of continuous posets
- The bounded proof property via step algebras and step frames
- Undecidable properties of extensions of provability logic. II
- All finitely axiomatizable tense logics of linear time flows are coNP-complete
- Stability of the Blok theorem
- Update to ``A survey of abstract algebraic logic
- An incomplete system of modal logic
- Intensional logics without iterative axioms
- An algebraic approach to non-classical logics
- Provability interpretations of modal logic
- Tools and techniques in modal logic
- Modal logic with names
- An algebraic theory of normal forms
- Constructive canonicity in non-classical logics
- Simulation and transfer results in modal logic -- a survey
- A survey of abstract algebraic logic
- Mathematical modal logic: A view of its evolution
- The decision problem of provability logic with only one atom
- A semantic hierarchy for intuitionistic logic
- Duality between modal algebras and neighbourhood frames
- Modal incompleteness revisited
- Willem Blok and modal logic
- Willem Blok's contribution to abstract algebraic logic
- Finite models constructed from canonical formulas
- Expressivity of coalgebraic modal logic: the limits and beyond
- Beyond Rasiowa's algebraic approach to non-classical logics
- Some embedding theorems for modal logic
- Normal forms in modal logic
- Canonicity for Intensional Logics with Even Axioms
- Nominal Sets
- Strongly Complete Logics for Coalgebras
- Ordinal Completeness of Bimodal Provability Logic GLB
- Rank-1 Modal Logics are Coalgebraic
- Atomless varieties
- Coalgebraic Predicate Logic
- Free Modal Algebras: A Coalgebraic Perspective
- An incomplete decidable modal logic
- Embedding Boolean Structures into Atomic Boolean Structures
- Algebraizable logics
- Syntactic aspects of modal incompleteness theorems
- Properties of independently axiomatizable bimodal logics
- Reduction of tense logic to modal logic. I
- Reduction of second‐order logic to modal logic
- Categories of frames for modal logic
- Reduction of tense logic to modal logic II
- Two simple incomplete modal logics
- Normal monomodal logics can simulate all others
- The undecidability of the disjunction property of propositional logics and other related problems
- An incomplete logic containing S4
- An incompleteness theorem in modal logic
- Tense Logic Without Tense Operators
- Algebraic semantics for quasi-classical modal logics
- Unified Correspondence
- Topological Interpretations of Provability Logic
- On generalizing free algebras for a functor
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Semantic analysis of tense logics
- Properties of Tense Logics
- Boolean Algebras with Operators. Part I
- Boolean Algebras with Operators
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Protoalgebraic logics
- Persistence and atomic generation for varieties 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