CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME
From MaRDI portal
Publication:5216979
DOI10.1017/S1755020319000352OpenAlexW2968640505WikidataQ127369089 ScholiaQ127369089MaRDI QIDQ5216979
Publication date: 20 February 2020
Published in: The Review of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1755020319000352
Cut-elimination and normal-form theorems (03F05) Temporal logic (03B44) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (3)
Free logics are cut-free ⋮ Free Definite Description Theory – Sequent Calculi and Cut Elimination ⋮ CUT-FREE COMPLETENESS FOR MODULAR HYPERSEQUENT CALCULI FOR MODAL LOGICS K, T, AND D
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eliminability of cut in hypersequent calculi for some modal logics of linear frames
- Hypersequents, logical consequence and intermediate logics for concurrency
- Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
- 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 constructive analysis of RM
- Cut Elimination Theorem for Non-Commutative Hypersequent Calculus
- Grafting hypersequents onto nested sequents
- Hypersequent Calculi for Godel Logics -- a Survey
- From Frame Properties to Hypersequent Rules in Modal Logics
- LINEAR TIME IN HYPERSEQUENT FRAMEWORK
This page was built for publication: CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME