Hypersequent Calculi for S5: The Methods of Cut Elimination

DOI10.12775/LLP.2015.018zbMath1372.03037OpenAlexW2098580639MaRDI QIDQ2987741

Kaja Bednarska, Andrzej Indrzejczak

Publication date: 18 May 2017

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

Full work available at URL: https://doi.org/10.12775/llp.2015.018

zbMATH Keywords

modal logiccut eliminationproof theoryhypersequent calculi

Mathematics Subject Classification ID

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

Related Items (11)

Tautology Elimination, Cut Elimination, and S5 ⋮ LINEAR TIME IN HYPERSEQUENT FRAMEWORK ⋮ Rooted hypersequent calculus for modal logic \textsf{S5} ⋮ Varieties of Relevant S5 ⋮ Sequent Calculi for Orthologic with Strict Implication ⋮ Falsification-aware calculi and semantics for normal modal logics including S4 and S5 ⋮ Cut Elimination Theorem for Non-Commutative Hypersequent Calculus ⋮ A generalized proof-theoretic approach to logical argumentation based on hypersequents ⋮ CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME ⋮ On a multilattice analogue of a hypersequent S5 calculus ⋮ Modal multilattice logics with Tarski, Kuratowski, and Halmos operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eliminability of cut in hypersequent calculi for some modal logics of linear frames
• Proof analysis in modal logic
• Gentzen calculi for modal propositional logic
• Proof methods for modal and intuitionistic logics
• A study of Kripke-type models for some modal logics by Gentzen's sequential method
• Hypersequents, logical consequence and intermediate logics for concurrency
• Display logic
• Hypersequent and display calculi -- a unified perspective
• Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
• Proof theory for fuzzy logics
• A deep inference system for the modal logic S5
• A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic
• Proof Analysis
• A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
• A constructive analysis of RM
• Cut-free double sequent calculus for S5
• A cut-free Gentzen formulation of the modal logic S5
• Displaying the modal logic of consistency
• From Frame Properties to Hypersequent Rules in Modal Logics

This page was built for publication: Hypersequent Calculi for S5: The Methods of Cut Elimination