COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3645060 (Why is no real title available?)
- scientific article; zbMATH DE number 5862929 (Why is no real title available?)
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 3650525 (Why is no real title available?)
- scientific article; zbMATH DE number 3124827 (Why is no real title available?)
- scientific article; zbMATH DE number 3825758 (Why is no real title available?)
- scientific article; zbMATH DE number 4041866 (Why is no real title available?)
- scientific article; zbMATH DE number 3485746 (Why is no real title available?)
- scientific article; zbMATH DE number 3532920 (Why is no real title available?)
- scientific article; zbMATH DE number 3603256 (Why is no real title available?)
- scientific article; zbMATH DE number 1215462 (Why is no real title available?)
- scientific article; zbMATH DE number 475198 (Why is no real title available?)
- scientific article; zbMATH DE number 1170091 (Why is no real title available?)
- scientific article; zbMATH DE number 1852920 (Why is no real title available?)
- scientific article; zbMATH DE number 1852922 (Why is no real title available?)
- scientific article; zbMATH DE number 1852925 (Why is no real title available?)
- scientific article; zbMATH DE number 2108192 (Why is no real title available?)
- scientific article; zbMATH DE number 4195937 (Why is no real title available?)
- scientific article; zbMATH DE number 2196586 (Why is no real title available?)
- scientific article; zbMATH DE number 5046360 (Why is no real title available?)
- A semantic hierarchy for intuitionistic logic
- A survey of abstract algebraic logic
- Algebraic semantics for quasi-classical modal logics
- Algebraizable logics
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- All finitely axiomatizable tense logics of linear time flows are coNP-complete
- An algebraic approach to non-classical logics
- An algebraic theory of normal forms
- An incomplete decidable modal logic
- An incomplete logic containing S4
- An incomplete system of modal logic
- An incompleteness theorem in modal logic
- Atomless varieties
- Beyond Rasiowa's algebraic approach to non-classical logics
- Boolean Algebras with Operators
- Boolean Algebras with Operators. Part I
- Canonicity for intensional logics with even axioms
- Categories of frames for modal logic
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Coalgebraic predicate logic
- Constructive canonicity in non-classical logics
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Duality between modal algebras and neighbourhood frames
- Embedding Boolean Structures into Atomic Boolean Structures
- Expressivity of coalgebraic modal logic: the limits and beyond
- Finite models constructed from canonical formulas
- Free Modal Algebras: A Coalgebraic Perspective
- Intensional logics without iterative axioms
- Isomorphism via translation
- Mathematical modal logic: A view of its evolution
- Modal incompleteness revisited
- Modal logic
- Modal logic with names
- Model theory and proof theory of coalgebraic predicate logic
- Nominal sets. Names and symmetry in computer science
- Normal forms in modal logic
- Normal monomodal logics can simulate all others
- On generalizing free algebras for a functor.
- One modal logic to rule them all?
- Ordinal completeness of bimodal provability logic GLB
- PSPACE-decidability of Japaridze's polymodal logic
- Partiality and adjointness in modal logic
- Persistence and atomic generation for varieties of Boolean algebras with operators
- Properties of Tense Logics
- Properties of independently axiomatizable bimodal logics
- Protoalgebraic logics
- Provability interpretations of modal logic
- Rank-1 modal logics are coalgebraic
- Reduction of second‐order logic to modal logic
- Reduction of tense logic to modal logic II
- Reduction of tense logic to modal logic. I
- Semantic analysis of tense logics
- Simulation and transfer results in modal logic -- a survey
- Some embedding theorems for modal logic
- Stability of the Blok theorem
- Strongly complete logics for coalgebras
- Subsystems of second order arithmetic
- Syntactic aspects of modal incompleteness theorems
- Tense Logic Without Tense Operators
- The bounded proof property via step algebras and step frames
- The connectives
- The decision problem of provability logic with only one atom
- The undecidability of the disjunction property of propositional logics and other related problems
- Tools and techniques in modal logic
- Topological interpretations of provability logic
- Two simple incomplete modal logics
- Ultraproducts of continuous posets
- Undecidable properties of extensions of provability logic. II
- Unified correspondence
- Update to ``A survey of abstract algebraic logic
- Willem Blok and modal logic
- Willem Blok's contribution to abstract algebraic logic
Cited in
(8)- Duality for \(\kappa\)-additive complete atomic modal algebras
- On the logic of belief and propositional quantification
- CARNAP’S PROBLEM FOR MODAL LOGIC
- scientific article; zbMATH DE number 970632 (Why is no real title available?)
- The orthologic of epistemic modals
- Ultraproducts of continuous posets
- B-frame duality
- Nonconservative extensions by propositional quantifiers and modal incompleteness
This page was built for publication: COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241231)
