David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 82 (1):157 - 176 (2006)
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.
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
Joseph R. Shoenfield (1967). Mathematical Logic. Reading, Mass.,Addison-Wesley Pub. Co..
Arnon Avron & Beata Konikowska (2005). Multi-Valued Calculi for Logics Based on Non-Determinism. Logic Journal of the Igpl 13 (4):365-387.
Matthias Baaz, Christian G. Fermüller, Gernot Salzer & Richard Zach (1998). Labeled Calculi and Finite-Valued Logics. Studia Logica 61 (1):7-33.
Walter A. Carnielli (1987). Systematization of Finite Many-Valued Logics Through the Method of Tableaux. Journal of Symbolic Logic 52 (2):473-493.
Citations of this work BETA
No citations found.
Similar books and articles
Arnon Avron (2005). A Non-Deterministic View on Non-Classical Negations. Studia Logica 80 (2-3):159 - 194.
Grigori Mints (1997). Indexed Systems of Sequents and Cut-Elimination. Journal of Philosophical Logic 26 (6):671-696.
Seiki Akama (1990). Subformula Semantics for Strong Negation Systems. Journal of Philosophical Logic 19 (2):217 - 226.
J. W. Degen (1999). Complete Infinitary Type Logics. Studia Logica 63 (1):85-119.
Arnon Avron & Anna Zamansky, A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-Deterministic Semantics.
Added to index2009-01-28
Total downloads69 ( #46,989 of 1,725,471 )
Recent downloads (6 months)67 ( #16,558 of 1,725,471 )
How can I increase my downloads?