Results

**1 - 2**of**2**### On the Role of Implication in Formal Logic

, 1998

"... 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 no ..."

Abstract
- Add to MetaCart

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. 1991 AMS (MOS) Classification: 03B40, 03F05, 03B20 Key words: Implication, negation, combinatory logic, lambda calculus, comprehension principle, normalization, cut-elimination...

### On the Role of Implication in Formal Logic

"... 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 no ..."

Abstract
- Add to MetaCart

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. 1991 AMS (MOS) Classification: 03B40, 03F05, 03B20 Key words: Implication, negation, combinatory logic, lambda calculus, comprehension principle, normalization, cut-elimination...