Journal of Symbolic Logic 65 (3):1076-1114 (2000)
Evidence is given that implication (and its special case, negation) carry the logical strength of a system of formal logic. This is done by proving normalization and cut elimination for a system based on combinatory logic or λ-calculus with logical constants for and, or, all, and exists, but with none for either implication or negation. The proof is strictly finitary, showing that this system is very weak. The results can be extended to a "classical" version of the system. They can also be extended to a system with a restricted set of rules for implication: the result is a system of intuitionistic higher-order BCK logic with unrestricted comprehension and without restriction on the rules for disjunction elimination and existential elimination. The result does not extend to the classical version of the BCK logic
|Keywords||Implication Negation Combinatory Logic Lambda Calculus Comprehension Principle Normalization Cut-Elimination BCK Logic|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Defining Relevant Implication in a Propositionally Quantified S.Philip Kremer - 1997 - Journal of Symbolic Logic 62 (4):1057-1069.
Classical Harmony: Rules of Inference and the Meaning of the Logical Constants.Peter Milne - 1994 - Synthese 100 (1):49 - 94.
Truth Table Logic, with a Survey of Embeddability Results.Neil Tennant - 1989 - Notre Dame Journal of Formal Logic 30 (3):459-484.
A Weak Intuitionistic Propositional Logic with Purely Constructive Implication.Mitsuhiro Okada - 1987 - Studia Logica 46 (4):371 - 382.
Substructural Implicational Logics Including the Relevant Logic E.Ryo Kashima & Norihiro Kamide - 1999 - Studia Logica 63 (2):181-212.
Added to index2009-01-28
Total downloads25 ( #201,003 of 2,158,887 )
Recent downloads (6 months)1 ( #354,157 of 2,158,887 )
How can I increase my downloads?