Year: 1936
Type: article
Abstract: t By Church's rules we shall mean the rules of procedure given in A. Church, A set of postulates for the foundation of logic, Annals of Mathematics, (2), vol.33 (1932), pp.346-366 (see pp. 355-356), as modified by S. C. Kleene, Proof by cases in formal logic, Annals of Mathematics, (2), vol.35 (1934), pp.529-544 (see p. 530).We assume familiarity with the material on pp.349-355 of Church's paper and in § §1, 2, 3, 5 of Kleene's paper.We shall refer to the latter paper as "Kleene."t The authors are indebted to Dr. S. C. Kleene for assistance in the preparation of this paper, in particular for the detection of an error in the first draft of it and for the suggestion of an improvement in the proof of Theorem 2.§ Note carefully the convention at the beginning of §3, Kleene, which we shall constantly use.|| Our use of "conv" allows us to write "A conv B" even in the case that no applications of I, II, or III are made in going from A to B and A is the same as B. But we write "A red B" only if there is at least one reduction in the process of going from A to B by applications of I and II, and use the notation "A conv-I-II B'' if we wish to allow the possibility of no reductions.* Kleene §5, p. 535.* The first kind of conversion which we have considered is essentially equivalent to a certain portion of the combinatory axioms and rules of H. B. Curry (American Journal of Mathematics, vol.52 (1930), pp.509-536, 789-834), as has been proved by J. B. Rosser (see Annals of Mathematics, (2), vol.36 (1935), p. 127).In terms of Curry's notation, our third kind of conversion can be thought of as differing from the first kind by the addition of the constancy function K.In dealing with properties of conversion, use of the Schönfinkel-Curry combinatory analysis appears in certain connections to be an important, even indispensable, device.But to recast the present discussion and results entirely into a combinatory notation would, it is thought, be awkward or impossible, because of the difficulty in finding a satisfactory equivalent, for combinations, of the notions of reduction and normal form as employed in this paper.
Authors: Alonzo Church, J. B. Rosser
Institution: Princeton University
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2086727636
