Article contents
A finitary metalanguage for extended basic logic
Published online by Cambridge University Press: 12 March 2014
Extract
In a series of five papers, Fitch has constructed a system of combinatory logic K′ which is adequate for much of classical analysis, and is demonstrably consistent if we assume the validity of transfinite induction up to a certain ordinal (at present undetermined). The system has the following peculiarities:
1.1. It is non-finitary, i.e. the class of Gödel-numbers of its theorems does not form the range of values of any recursive function (nor, as a matter of fact, of any function definable in elementary number theory).
1.2. It does not permit quantification over real numbers; i.e. it contains no theorems of the form
1.3. Because of 1.1, we cannot, except in trivial cases, construct actual proofs in K′; we have to resort to a metalanguage (of undetermined strength) in order to show that certain formulae are theorems of K′. Also because of 1.2, many important theorems of classical mathematics are not forthcoming in K′ itself, but only in the aforementioned metalanguage, e.g. in the form
where ‘x’ is a syntactical rather than a numerical variable, a U-real is an expression of K′ rather than a number, and ‘ … x– – –’ ascribes a syntactical rather than a real number-theoretic property to x.
The purpose of this paper is to construct a finitary metalanguage for K′ in which all of Fitch's important theorems may be proved.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1952
References
REFERENCES
- 2
- Cited by