Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T04:47:18.494Z Has data issue: false hasContentIssue false

On the role of implication in formal logic

Published online by Cambridge University Press:  12 March 2014

Jonathan P. Seldin*
Affiliation:
Department of Mathematics, Concordia University, Montréal, Québec, Canada
*
Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, Canada. E-mail: jonathan.seldin@uleth.ca

Abstract

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable