We present a multiple-conclusion hypersequent system for the standard first-order Gödel logic. We provide a constructive, direct, and simple proof of the completeness of the cut-free part of this system, thereby proving both completeness for its standard semantics, and the admissibility of the cut rule in the full system. The results also apply to derivations from assumptions (or non-logical axioms), showing that such derivations can be confined to those in which cuts are made only on formulas which occur in the assumptions. Finally, the results about the multiple-conclusion system are used to show that the usual single-conclusion system for the standard first-order Gödel logic also admits (strong) cut-admissibility. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Avron, A., & Lahav, O. (2011). A multiple-conclusion calculus for first-order Gödel logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6651 LNCS, pp. 456–469). https://doi.org/10.1007/978-3-642-20712-9_36
Mendeley helps you to discover research relevant for your work.