The DOI matches its Crossref record.
Some properties of conversion
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Equations and Rewrite Rules: A Survey
Huet, G., & Oppen, D. C. (1980) · Formal Language Theory · doi:10.1016/b978-0-12-115350-2.50017-8 · Cited by 714
DERSHOWITZ, N., & JOUANNAUD, J.-P. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50011-1 · Cited by 579
Dependent types in practical programming
Xi, H., & Pfenning, F. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292560 · Cited by 575
Systems of logic based on ordinals
(2001) · Mathematical Logic · doi:10.1016/b978-044450423-4/50007-3 · Cited by 543
Conception, evolution, and application of functional programming languages
Hudak, P. (1989) · ACM Computing Surveys · doi:10.1145/72551.72554 · Cited by 409
Metadata
- Authors
- Church, A., & Rosser, J. B.
- Venue
- Transactions of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1936
- Volume
- 39
- Issue
- 3
- Pages
- 472-482
- ISSN
- 0002-9947 (ISSN-L)
- 1088-6850
- OpenAlex
- W2086727636
- Cited by
- 285
- References
- 0
- FWCI
- 10.60
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Some properties of conversion. https://app.cochat.ai/papers/10.1090/s0002-9947-1936-1501858-0
- The paper
- Church, A., & Rosser, J. B. (1936). Some properties of conversion. Transactions of the American Mathematical Society. https://doi.org/10.1090/s0002-9947-1936-1501858-0
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.