A Multiple-Conclusion Calculus for First-Order Gödel Logic
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.
KeywordsIntuitionistic Logic Extended Sequent Proof Theory Sequent Calculus Constant Symbol
Unable to display preview. Download preview PDF.
- 4.Avron, A.: A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic. Journal of Logic and Computation (2009), doi:10.1093/logcom/exp055Google Scholar
- 9.Ciabattoni, A., Galatos, N., Terui, K.: From Axioms to Analytic Rules in Nonclassical Logics. In: Proceedings of LICS, pp. 229–240 (2008)Google Scholar
- 15.Gödel, K.: On the Intuitionistic Propositional Calculus. In: Feferman, S., et al. (eds.) Collected Work, vol. 1, Oxford University Press, Oxford (1986)Google Scholar