Provability multilattice logic
From MaRDI portal
Publication:6040535
DOI10.1080/11663081.2023.2178780zbMath1517.03041OpenAlexW4321248253MaRDI QIDQ6040535
Publication date: 17 May 2023
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/11663081.2023.2178780
Logical aspects of lattices and related structures (03G10) First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Truth and falsehood. An inquiry into generalized logical values
- The modal logic of provability: cut-elimination
- Proof analysis in modal logic
- Some useful 16-valued logics: How a computer network should think
- Gentzen calculi for modal propositional logic
- A few more useful 8-valued logics for reasoning with tetralattice \(EIGHT_{4}\)
- The modal logic of provability. The sequential approach
- A modal sequent calculus for a fragment of arithmetic
- Provability interpretations of modal logic
- Cut-free sequent calculi for some tense logics
- Modal multilattice logic
- Four-valued paradefinite logics
- Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant
- Intuitive semantics for first-degree entailments and `coupled trees'
- Reasoning with logical bilattices
- Bi-facial truth: a case for generalized truth values
- Alternative multilattice logics: an approach based on monosequent and indexed monosequent calculi
- Circular proofs for the Gödel-Löb provability logic
- On the reduction property for GLP-algebras
- Interpolation properties for provability logics GL and GLP
- VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED
- Embedding from multilattice logic into classical logic and vice versa
- Truth, Falsehood, Information and Beyond: The American Plan Generalized
- Inconsistent Models (and Infinite Models) for Arithmetics with Constructible Falsity
- On a multilattice analogue of a hypersequent S5 calculus
- The Method of Tree-Hypersequents for Modal Propositional Logic
- On the proof theory of the modal logic for arithmetic provability
- The Trilattice of Constructive Truth Values
- Non-commutative classical arithmetical sequent calculi are intuitionistic
- Modal multilattice logics with Tarski, Kuratowski, and Halmos operators
- Relevant Arithmetic
- Two proofs of the algebraic completeness theorem for multilattice logic
- A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY
- A novel approach to equality
- Basic modal congruent and monotonic multilattice logics
