A Basis for a Mathematical Theory of Computation )
The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Recursive functions of symbolic expressions and their computation by machine, Part I
McCarthy, J. (1960) · Communications of the ACM · doi:10.1145/367177.367199 · Cited by 1,387
The calculi of lambda-conversion
Rosser, B. (1941) · Medical Entomology and Zoology · Cited by 1,168
Computability and Unsolvability.
Elgot, C., & Davis, M. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002808 · Cited by 980
McCarthy, J. (1960) · Cited by 931
McCarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., & Levin, M. I. (1962) · doi:10.21236/ad0406138 · Cited by 555
Introduction to mathematical logic
Curry, H. B. (1957) · Journal of the Franklin Institute · doi:10.1016/0016-0032(57)90984-5 · Cited by 503
Recursive predicates and quantifiers
Kleene, S. C. (1943) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1943-0007371-8 · Cited by 363
Church, A. (1937) · Journal of Symbolic Logic · doi:10.1017/s002248120003958x · Cited by 115
Computer programs for checking mathematical proofs
McCarthy, J. (1962) · Proceedings of symposia in pure mathematics · doi:10.1090/pspum/005/9998 · Cited by 45
Cited by
Assigning Meanings to Programs
Floyd, R. W. (1993) · Studies in Cognitive Systems · doi:10.1007/978-94-011-1793-7_4 · Cited by 1,079
Simplification by Cooperating Decision Procedures
Nelson, G., & Oppen, D. C. (1979) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357073.357079 · Cited by 908
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
Kowalski, R. (1979) · Communications of the ACM · doi:10.1145/359131.359136 · Cited by 600
Church: a language for generative models
Goodman, N., Mansinghka, V., Roy, D. M., Bonawitz, K., & Tenenbaum, J. B. (2012) · arXiv · doi:10.48550/arxiv.1206.3255 · Cited by 577
Metadata
- Venue
- Studies in Logic and the Foundations of Mathematics
- Publisher
- Elsevier
- Published
- 1963
- Pages
- 33-70
- ISSN
- 0049-237X (ISSN-L)
- OpenAlex
- W2166089338
- Cited by
- 692
- References
- 10
- FWCI
- 6.54
- Type
- book chapter
- 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
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.