Basic proof theory
The method of hypersequents in the proof theory of propositional non-classical logics
Logic: from foundations to applications
Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Comparing the Complexity of Cut-Elimination Methods
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic
ISMVL '01 Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic
Analytic calculi for monoidal t-norm based logic
Fundamenta Informaticae
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A hypersequent system for gödel-dummett logic with non-constant domains
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
A local system for intuitionistic logic
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Analytic Calculi for Monoidal T-norm Based Logic
Fundamenta Informaticae
| Hi-index | 0.00 |
We present a Sch眉tte-Tait style cut-elimination proof for the hypersequent calculus HIF for first-order G枚del logic. This proof allows to bound the depth of the resulting cut-free derivation by 4驴(d)|d|, where |d| is the depth of the original derivation and 驴(d) the maximal complexity of cut-formulas in it. We compare this Sch眉tte-Tait style cut-elimination proof to a Gentzen style proof.