Cut Elimination Theorem for Non-Commutative Hypersequent Calculus

DOI10.18778/0138-0680.46.1.2.10zbMath1423.03239OpenAlexW2801542259WikidataQ129921755 ScholiaQ129921755MaRDI QIDQ4608559

Andrzej Indrzejczak

Publication date: 21 March 2018

Published in: Bulletin of the Section of Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.18778/0138-0680.46.1.2.10

zbMATH Keywords

cut eliminationtemporal logiclinear timehypersequent calculus

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Temporal logic (03B44)

Related Items (5)

Unnamed Item ⋮ CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME ⋮ On a multilattice analogue of a hypersequent S5 calculus ⋮ Two proofs of the algebraic completeness theorem for multilattice logic ⋮ CUT-FREE COMPLETENESS FOR MODULAR HYPERSEQUENT CALCULI FOR MODAL LOGICS K, T, AND D

Cites Work

• Unnamed Item
• Unnamed Item
• Eliminability of cut in hypersequent calculi for some modal logics of linear frames
• Gentzen calculi for modal propositional logic
• Hypersequents, logical consequence and intermediate logics for concurrency
• Proof theory for fuzzy logics
• Hypersequent Calculi for S5: The Methods of Cut Elimination
• Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications
• Linear Nested Sequents, 2-Sequents and Hypersequents
• A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
• A constructive analysis of RM
• From Frame Properties to Hypersequent Rules in Modal Logics
• LINEAR TIME IN HYPERSEQUENT FRAMEWORK

This page was built for publication: Cut Elimination Theorem for Non-Commutative Hypersequent Calculus