David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
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)|
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
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
David J. Pym (1995). A Note on the Proof Theory the λII-Calculus. Studia Logica 54 (2):199 - 230.
Philip Kremer (1997). Defining Relevant Implication in a Propositionally Quantified S. Journal of Symbolic Logic 62 (4):1057-1069.
Garrel Pottinger (1979). On Analysing Relevance Constructively. Studia Logica 38 (2):171 - 185.
Ross Thomas Brady (2010). Free Semantics. Journal of Philosophical Logic 39 (5):511 - 529.
Carlos A. OLLER (1999). Paraconsistency and Analyticity. Logic and Logical Philosophy 7 (1):91-99.
Peter Milne (1994). Classical Harmony: Rules of Inference and the Meaning of the Logical Constants. Synthese 100 (1):49 - 94.
Arnold Koslow (1992/2005). A Structuralist Theory of Logic. Cambridge University Press.
Neil Tennant (1989). Truth Table Logic, with a Survey of Embeddability Results. Notre Dame Journal of Formal Logic 30 (3):459-484.
Mitsuhiro Okada (1987). A Weak Intuitionistic Propositional Logic with Purely Constructive Implication. Studia Logica 46 (4):371 - 382.
Ryo Kashima & Norihiro Kamide (1999). Substructural Implicational Logics Including the Relevant Logic E. Studia Logica 63 (2):181-212.
Added to index2009-01-28
Total downloads18 ( #106,904 of 1,679,364 )
Recent downloads (6 months)3 ( #78,612 of 1,679,364 )
How can I increase my downloads?