The Method of Tree-Hypersequents for Modal Propositional Logic

DOI10.1007/978-1-4020-9084-4_3zbMath1166.03009OpenAlexW101915042MaRDI QIDQ3600562

Francesca Poggiolesi

Publication date: 5 February 2009

Published in: Towards Mathematical Philosophy (Search for Journal in Brave)

Full work available at URL: https://halshs.archives-ouvertes.fr/halshs-00775815/file/BookChapter-Springer%202009.pdf

zbMATH Keywords

modal logicpropositional logicsequent calculushypersequentscontraction-freecut-freetree-hypersequents

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items (27)

A linear logic framework for multimodal logics ⋮ Deep sequent systems for modal logic ⋮ MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description) ⋮ Label-free natural deduction systems for intuitionistic and classical modal logics ⋮ Linear Nested Sequents, 2-Sequents and Hypersequents ⋮ Uniform interpolation via nested sequents ⋮ A pure view of ecumenical modalities ⋮ Natural deduction calculi and sequent calculi for counterfactual logics ⋮ Provability multilattice logic ⋮ Mechanising Gödel-Löb provability logic in HOL light ⋮ An ecumenical notion of entailment ⋮ Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach ⋮ Disentangling structural connectives or life without display property ⋮ Nested sequents for intermediate logics: the case of Gödel-Dummett logics ⋮ Natural deduction calculi for classical and intuitionistic S5 ⋮ A cut-free sequent system for two-dimensional modal logic, and why it matters ⋮ Nested sequents for intuitionistic logics ⋮ A fresh view of linear logic as a logical framework ⋮ Maehara-style modal nested calculi ⋮ On Height and Happiness ⋮ On graphs for intuitionistic modal logics ⋮ A contraction-free and cut-free sequent calculus for propositional dynamic logic ⋮ Syntactic cut-elimination for a fragment of the modal mu-calculus ⋮ Display calculi and other modal calculi: a comparison ⋮ Unnamed Item ⋮ Focused and Synthetic Nested Sequents ⋮ A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY

Cites Work

• Proof analysis in modal logic
• The modal logic of provability. The sequential approach
• Cut-free sequent calculi for some tense logics
• Indexed systems of sequents and cut-elimination
• Gentzen systems for modal logic
• A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
• Sequent Calculi for Normal Modal Propositional Logics
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Method of Tree-Hypersequents for Modal Propositional Logic