The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A formulation of the simple theory of types
Abstract
The purpose of the present paper is to give a formulation of the simple theory of types which incorporates certain features of the calculus of λ-conversion. A complete incorporation of the calculus of λ-conversion into the theory of types is impossible if we require that λ x and juxtaposition shall retain their respective meanings as an abstraction operator and as denoting the application of function to argument. But the present partial incorporation has certain advantages from the point of view of type theory and is offered as being of interest on this basis (whatever may be thought of the finally satisfactory character of the theory of types as a foundation for logic and mathematics). For features of the formulation which are not immediately connected with the incorporation of λ-conversion, we are heavily indebted to Whitehead and Russell, Hilbert and Ackermann, Hilbert and Bernays, and to forerunners of these, as the reader familiar with the works in question will recognize. The class of type symbols is described by the rules that ı and o are each type symbols and that if α and β are type symbols then (αβ) is a type symbol: it is the least class of symbols which contains the symbols ı and o and is closed under the operation of forming the symbol (αβ) from the symbols α and β.
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
Cites
M., G. B. (1911) · Nature · doi:10.1038/087273a0 · Cited by 994
Über die Bausteine der mathematischen Logik
Schönfinkel, M. (1924) · Mathematische Annalen · doi:10.1007/bf01448013 · Cited by 471
Axiomatische Untersuchung des Aussagen-Kalkuls der ?Principia Mathematica?
Bernays, P. (1926) · Mathematische Zeitschrift · doi:10.1007/bf01283841 · Cited by 166
A Theory of Positive Integers in Formal Logic. Part II
Kleene, S. C. (1935) · American Journal of Mathematics · doi:10.2307/2371199 · Cited by 85
Cited by
Coquand, T., & Huet, G. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90005-3 · Cited by 1,082
A framework for defining logics
Harper, R., Honsell, F., & Plotkin, G. (1993) · Journal of the ACM · doi:10.1145/138027.138060 · Cited by 990
A unification algorithm for typed λ-calculus
Huet, G. P. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90011-0 · Cited by 510
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
MILLER, D. (1991) · Journal of Logic and Computation · doi:10.1093/logcom/1.4.497 · Cited by 382
History of Interactive Theorem Proving
Harrison, J., Urban, J., & Wiedijk, F. (2014) · Handbook of the History of Logic · doi:10.1016/b978-0-444-51624-4.50004-6 · Cited by 107
Metadata
- Authors
- Church, A.
- Venue
- Journal of Symbolic Logic
- Publisher
- Cambridge University Press (CUP)
- Published
- 1940-06
- Volume
- 5
- Issue
- 2
- Pages
- 56-68
- ISSN
- 0022-4812 (ISSN-L)
- 1943-5886
- OpenAlex
- W1996404651
- Cited by
- 1,903
- References
- 4
- FWCI
- 38.15
- Type
- journal article
- Language
- en
- Open access
- closed
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: A formulation of the simple theory of types. https://app.cochat.ai/papers/10.2307/2266170
- The paper
- Church, A. (1940). A formulation of the simple theory of types. Journal of Symbolic Logic. https://doi.org/10.2307/2266170
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.