Abstract
Canonical Propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the sub-formula property, in which exactly one occurrence of a connective is introduced in the conclusion, and no other occurrence of any connective is mentioned anywhere else. In this paper we considerably generalize the notion of a “canonical system” to first-order languages and beyond. We extend the Propositional coherence criterion for the non-triviality of such systems to rules with unary quantifiers and show that it remains constructive. Then we provide semantics for such canonical systems using 2-valued non-deterministic matrices extended to languages with quantifiers, and prove that the following properties are equivalent for a canonical system G: (1) G admits Cut-Elimination, (2) G is coherent, and (3) G has a characteristic 2-valued non-deterministic matrix.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Avron, A., ‘Simple Consequence Relations’, Information and Computation 92 (1):105–139, 1991.
Avron, A., and B. Konikowska, ‘Multi-valued calculi for Logics based on Non-determinism’, Logic Journal of the IJPL 13: 365–387, 2005.
Avron, A., and I. Lev, ‘Canonical Propositional Gentzen-type Systems’, Proceedings of the 1st International Joint Conference on Automated Reasoning (IJCAR 2001), R. Gore, A. Leitsch, T. Nipkow, (eds.), Springer Verlag, LNAI 2083, Springer Verlag, 2001, pp. 529–544.
Avron, A., and I. Lev, ‘Non-deterministic Multi-valued Structures’, Journal of Logic and Computation, 15: 241–261, 2005.
Avron, A., and A. Zamansky, ‘Quantification in Non-deterministic Multi-valued Structures’, Proceedings of the 35th IEEE International Symposium on Multiple-Valued Logics, IEEE Computer Society Press, 2005, pp. 296–301.
Baaz, M., C.G. Fermuller, and R. Zach, ‘Elimination of Cuts in First-order Finite-valued Logics’, Information Processing Cybernetics 29 (6):333–355, 1994.
Baaz, M., C.G. Fermuller, G. Salzer, and R. Zach, ‘Labeled Calculi and Finite-valued Logics’, Studia Logica 61: 7–33, 1998.
Carnielli W., ‘Systematization of Finite Many-valued Logics through the method of Tableaux’, Journal of Symbolic Logic 52 (2):473–493, 1987.
Gentzen, G., ‘Investigations into Logical Deduction’, in The collected works of Gerhard Gentzen, (M.E. Szabo (ed.), North Holland, Amsterdam, 1969, pp. 68–131.
Negri, S., and J. Von Plato, Structural Proof Theory, Cambridge University Press, 2001.
Shoenfield, J. R., ‘Mathematical Logic’, Association for Symbolic Logic, 1967.
Sundholm, G., ‘Proof Theory and Meaning’, in Handbook of Philosophical Logic (D. Gabbay and F. Guenthner, (eds.), vol. 3, Reidel Publishing Company, 1986, pp. 471–506.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zamansky, A., Avron, A. Cut-Elimination and Quantification in Canonical Systems. Stud Logica 82, 157–176 (2006). https://doi.org/10.1007/s11225-006-6611-6
Issue Date:
DOI: https://doi.org/10.1007/s11225-006-6611-6