On a multilattice analogue of a hypersequent S5 calculus

DOI10.12775/LLP.2019.031zbMath1458.03012MaRDI QIDQ3387898

Oleg Grigor'ev, Yaroslav I. Petrukhin

Publication date: 8 January 2021

Published in: Logic and Logical Philosophy (Search for Journal in Brave)

zbMATH Keywords

modal logicembedding theoremcut eliminationinterpolation theoremhypersequent calculusgeneralized truth valuesmultilattice logicHilbert-style calculus

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Many-valued logic (03B50)

Related Items (6)

Provability multilattice logic ⋮ Falsification-aware calculi and semantics for normal modal logics including S4 and S5 ⋮ Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation ⋮ Modal extension of ideal paraconsistent four-valued logic and its subsystem ⋮ Two proofs of the algebraic completeness theorem for multilattice logic ⋮ Modal multilattice logics with Tarski, Kuratowski, and Halmos operators

Cites Work

• \(\mathbf{BK}\)-lattices. Algebraic semantics for Belnapian modal logics
• Eliminability of cut in hypersequent calculi for some modal logics of linear frames
• Truth and falsehood. An inquiry into generalized logical values
• Natural deduction, hybrid systems and modal logics
• Proof analysis in modal logic
• Some useful 16-valued logics: How a computer network should think
• Proof methods for modal and intuitionistic logics
• A study of Kripke-type models for some modal logics by Gentzen's sequential method
• Modal multilattice logic
• Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant
• Disentangling \textsf{FDE}-based paraconsistent modal logics
• Intuitive semantics for first-degree entailments and `coupled trees'
• Display logic
• Reasoning with logical bilattices
• A deep inference system for the modal logic S5
• Four-valued modal logic: Kripke semantics and duality
• Hypersequent Calculi for S5: The Methods of Cut Elimination
• The lattice of Belnapian modal logics: Special extensions and counterparts
• Embedding from multilattice logic into classical logic and vice versa
• Truth, Falsehood, Information and Beyond: The American Plan Generalized
• A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
• MANY-VALUED MODAL LOGICS: A SIMPLE APPROACH
• A constructive analysis of RM
• Cut-free double sequent calculus for S5
• A cut-free Gentzen formulation of the modal logic S5
• The Trilattice of Constructive Truth Values
• Useful Four-Valued Extension of the Temporal Logic KtT4
• Cut Elimination Theorem for Non-Commutative Hypersequent Calculus
• BELNAP–DUNN MODAL LOGICS: TRUTH CONSTANTS VS. TRUTH VALUES
• Two proofs of the algebraic completeness theorem for multilattice logic
• From Frame Properties to Hypersequent Rules in Modal Logics
• LINEAR TIME IN HYPERSEQUENT FRAMEWORK
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a multilattice analogue of a hypersequent S5 calculus