Hypersequent Calculi for Godel Logics -- a Survey

From MaRDI portal
Revision as of 02:23, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4812316


DOI10.1093/logcom/13.6.835zbMath1051.03046MaRDI QIDQ4812316

Christian G. Fermüller, Matthias Baaz, Agata Ciabattoni

Publication date: 7 September 2004

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/13.6.835


03F05: Cut-elimination and normal-form theorems


Related Items

Unnamed Item, Prawitz, Proofs, and Meaning, CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME, Linear Logic Properly Displayed, Comparing Calculi for First-Order Infinite-Valued Łukasiewicz Logic and First-Order Rational Pavelka Logic, Hypersequent rules with restricted contexts for propositional modal logics, Eliminability of cut in hypersequent calculi for some modal logics of linear frames, Intermediate logics and Visser's rules, Hypersequent calculi for intuitionistic logic with classical atoms, Graph-based decision for Gödel-Dummett logics, An analysis of Ruspini partitions in Gödel logic, Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus, A cut-free calculus for second-order Gödel logic, Ten problems in Gödel logic, Multicomponent proof-theoretic method for proving interpolation properties, From semantic games to provability: the case of Gödel logic, From truth degree comparison games to sequents-of-relations calculi for Gödel logic, Proofs and countermodels in non-classical logics, Hypersequent and display calculi -- a unified perspective, Terminating calculi for propositional Dummett logic with subformula property, First-order Gödel logics, On the rules of intermediate logics, A Generalisation of the Hyperresolution Principle to First Order Gödel Logic, On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC, A Multiple-Conclusion Calculus for First-Order Gödel Logic, A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains, Through an Inference Rule, Darkly