A propositional logic with explicit fixed points
From MaRDI portal
Publication:1156789
DOI10.1007/BF01874706zbMath0469.03012MaRDI QIDQ1156789
Publication date: 1981
Published in: Studia Logica (Search for Journal in Brave)
Kripke modelsPeano arithmeticformal propositional logicinterpreting implication as formal provabilitySolovay's provability logic
Modal logic (including the logic of norms) (03B45) Philosophical and critical aspects of logic and foundations (03A05) Categoricity and completeness of theories (03C35)
Related Items
On hyperarithmetical realizability, 1998 European Summer Meeting of the Association for Symbolic Logic, ON EQUATIONAL COMPLETENESS THEOREMS, European Summer Meeting of the Association for Symbolic Logic, Alternative Semantics for Visser’s Propositional Logics, Monotone subintuitionistic logic: duality and transfer results, Binary modal companions for subintuitionistic logics, Residuated expansions of lattice-ordered structures, Implication via spacetime, On PBZ*-lattices, Categorical abstract algebraic logic: referential algebraic semantics, BINARY KRIPKE SEMANTICS FOR A STRONG LOGIC FOR NAIVE TRUTH, Extensions of Solovay's system \(\mathbf{S}\) without independent sets of axioms, On self‐distributive weak Heyting algebras, Sequent Calculi for Orthologic with Strict Implication, Choice-free topological duality for implicative lattices and Heyting algebras, COLLECTION FRAMES FOR DISTRIBUTIVE SUBSTRUCTURAL LOGICS, Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability, Interpolation Property on Visser's Formal Propositional Logic, Sequent calculi for Visser's propositional logics, Provability and interpretability logics with restricted realizations, ASSERTIONALLY EQUIVALENT QUASIVARIETIES, A closer look at some subintuitionistic logics, Normal modal substructural logics with strong negation, Neighborhood Semantics for Basic and Intuitionistic Logic, The de Jongh property for basic arithmetic, 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000, On non-self-referential fragments of modal logics, Modal companions of intermediate propositional logics, The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions, Basic predicate calculus, A canonical model for constant domain basic first-order logic, Latarres, lattices with an arrow, Proof complexity of substructural logics, Kripke semantics for fuzzy logics, Constructive Embedding from Extensions of Logics of Strict Implication into Modal Logics, Completions of Basic Algebras, Complexity of intuitionistic propositional logic and its fragments, Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter, Correspondences between gentzen and hilbert systems, Easkia Duality and Its Extensions, 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05, Representations of Sheffer stroke algebras and Visser algebras, Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability
Cites Work
- Unnamed Item
- Unnamed Item
- Provability, truth, and modal logic
- Provability interpretations of modal logic
- Calculating self-referential statements. I: Explicit calculations
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- A propositional calculus with denumerable matrix
- Arithmetical necessity, provability and intuitionistic logic
