Provability multilattice logic
type: Item
instance of: scholarly article
title: Provability multilattice logic
zbMATH Open document ID: 1517.03041
DOI: 10.1080/11663081.2023.2178780
author: Yaroslav I. Petrukhin
published in: Journal of Applied Non-Classical Logics
publication date: 2023-05-17T00:00:00Z
Mathematics Subject Classification ID: 03F45
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 03G10
zbMATH DE Number: 7686963
zbMATH Keywords: multilattice logic
zbMATH Keywords: provability logic
zbMATH Keywords: nested sequent calculus
zbMATH Keywords: Peano arithmetic
zbMATH Keywords: embedding theorem
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/11663081.2023.2178780
OpenAlex ID: W4321248253
cites work: Reasoning with logical bilattices
cites work: Four-valued paradefinite logics
cites work: On the reduction property for GLP-algebras
cites work: Q3206928
cites work: Q4397069
cites work: Q3509048
cites work: Intuitive semantics for first-degree entailments and `coupled trees'
cites work: Inconsistent Models (and Infinite Models) for Arithmetics with Constructible Falsity
cites work: Q3743300
cites work: Valentini's cut-elimination for provability logic resolved
cites work: On a multilattice analogue of a hypersequent S5 calculus
cites work: Two proofs of the algebraic completeness theorem for multilattice logic
cites work: Modal multilattice logics with Tarski, Kuratowski, and Halmos operators
cites work: Basic modal congruent and monotonic multilattice logics
cites work: A novel approach to equality
cites work: Q5144357
cites work: Alternative multilattice logics: an approach based on monosequent and indexed monosequent calculi
cites work: Embedding from multilattice logic into classical logic and vice versa
cites work: Modal multilattice logic
cites work: Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant
cites work: Cut-free sequent calculi for some tense logics
cites work: On the proof theory of the modal logic for arithmetic provability
cites work: Q4121962
cites work: Relevant Arithmetic
cites work: Proof analysis in modal logic
cites work: Structural proof theory. With an appendix by Aarne Ranta
cites work: Q3256323
cites work: A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY
cites work: The Method of Tree-Hypersequents for Modal Propositional Logic
cites work: Gentzen calculi for modal propositional logic
cites work: Q3474639
cites work: Non-commutative classical arithmetical sequent calculi are intuitionistic
cites work: A modal sequent calculus for a fragment of arithmetic
cites work: The modal logic of provability. The sequential approach
cites work: Interpolation properties for provability logics GL and GLP
cites work: Circular proofs for the Gödel-Löb provability logic
cites work: Truth, Falsehood, Information and Beyond: The American Plan Generalized
cites work: The Trilattice of Constructive Truth Values
cites work: Some useful 16-valued logics: How a computer network should think
cites work: Truth and falsehood. An inquiry into generalized logical values
cites work: Provability interpretations of modal logic
cites work: Q4716271
cites work: The modal logic of provability: cut-elimination
cites work: Q5483018
cites work: A few more useful 8-valued logics for reasoning with tetralattice \(EIGHT_{4}\)
cites work: Bi-facial truth: a case for generalized truth values
description: scientific article; zbMATH DE number 7686963