Provability multilattice logic
From MaRDI portal
Recommendations
Cites work
- A few more useful 8-valued logics for reasoning with tetralattice \(EIGHT_{4}\)
- A modal sequent calculus for a fragment of arithmetic
- A novel approach to equality
- A purely syntactic and cut-free sequent calculus for the modal logic of provability
- Alternative multilattice logics: an approach based on monosequent and indexed monosequent calculi
- Basic modal congruent and monotonic multilattice logics
- Bi-facial truth: a case for generalized truth values
- Circular proofs for the Gödel-Löb provability logic
- Connexive modal logic
- Cut-free sequent calculi for some tense logics
- Deep sequent systems for modal logic
- Embedding from multilattice logic into classical logic and vice versa
- Four-valued paradefinite logics
- Gentzen calculi for modal propositional logic
- scientific article; zbMATH DE number 3648682 (Why is no real title available?)
- scientific article; zbMATH DE number 3139759 (Why is no real title available?)
- scientific article; zbMATH DE number 4142013 (Why is no real title available?)
- scientific article; zbMATH DE number 3976991 (Why is no real title available?)
- scientific article; zbMATH DE number 3547370 (Why is no real title available?)
- scientific article; zbMATH DE number 1170091 (Why is no real title available?)
- scientific article; zbMATH DE number 949290 (Why is no real title available?)
- scientific article; zbMATH DE number 7297101 (Why is no real title available?)
- Inconsistent models (and infinite models) for arithmetics with constructible falsity
- Interpolation properties for provability logics GL and GLP
- Intuitive semantics for first-degree entailments and `coupled trees'
- Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant
- Modal multilattice logic
- Modal multilattice logics with Tarski, Kuratowski, and Halmos operators
- Non-commutative classical arithmetical sequent calculi are intuitionistic
- On a multilattice analogue of a hypersequent S5 calculus
- On the proof theory of the modal logic for arithmetic provability
- On the reduction property for GLP-algebras
- Proof analysis in modal logic
- Provability interpretations of modal logic
- Reasoning with logical bilattices
- Relevant arithmetic
- Some useful 16-valued logics: How a computer network should think
- Structural proof theory. With an appendix by Aarne Ranta
- The Method of Tree-Hypersequents for Modal Propositional Logic
- The modal logic of provability. The sequential approach
- The modal logic of provability: cut-elimination
- The Trilattice of Constructive Truth Values
- Truth and falsehood. An inquiry into generalized logical values
- Truth, falsehood, information and beyond: the American plan generalized
- Two proofs of the algebraic completeness theorem for multilattice logic
- Valentini's cut-elimination for provability logic resolved
Cited in
(6)- A coding theoretic study of MLL proof nets
- scientific article; zbMATH DE number 4006264 (Why is no real title available?)
- MÜNCHHAUSEN PROVABILITY
- Proof-producing synthesis of ML from higher-order logic
- Two proofs of the algebraic completeness theorem for multilattice logic
- Provability in predicate product logic
This page was built for publication: Provability multilattice logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6040535)