Systems of logic based on ordinals
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
These documents can only be used for educational and research purposes (“Fair use”) as per U.S. Copyright law (text below). By accessing this file, all users agree that their use falls within fair use as defined by the copyright law. They further agree to request permission of the Princeton University Library (and pay any fees, if applicable) if they plan to publish, broadcast, or otherwise disseminate this material. This includes all forms of electronic distribution.
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
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (1931) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01700692 · Cited by 2,395
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (2006) · Monatshefte für Mathematik · doi:10.1007/s00605-006-0423-7 · Cited by 2,077
An Unsolvable Problem of Elementary Number Theory
Church, A. (1936) · American Journal of Mathematics · doi:10.2307/2371045 · Cited by 1,763
Hilbert, D. (1926) · Mathematische Annalen · doi:10.1007/bf01206605 · Cited by 776
Die Widerspruchsfreiheit der reinen Zahlentheorie
Gentzen, G. (1936) · Mathematische Annalen · doi:10.1007/bf01565428 · Cited by 614
General recursive functions of natural numbers
Kleene, S. C. (1936) · Mathematische Annalen · doi:10.1007/bf01565439 · Cited by 593
Finite combinatory processes—formulation
Post, E. L. (1936) · Journal of Symbolic Logic · doi:10.2307/2269031 · Cited by 516
On undecidable propositions of formal mathematical systems
Gödel, K., Kleene, S. C., & Rosser, J. B. (1934) · Medical Entomology and Zoology · Cited by 401
Der Wahrheitsbegriff in den formalisierten Sprachen
Tarski, A. (1971) · De Gruyter eBooks · doi:10.1515/9783112611302-018 · Cited by 293
Church, A., & Rosser, J. B. (1936) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1936-1501858-0 · Cited by 285
λ-definability and recursiveness
Kleene, S. C. (1936) · Duke Mathematical Journal · doi:10.1215/s0012-7094-36-00227-2 · Cited by 267
Computability and λ-definability
Turing, A. M. (1937) · Journal of Symbolic Logic · doi:10.2307/2268280 · Cited by 262 · cited 11×
“A. M. Turing (A dissertation presented to the faculty of Princeton University in candidacy for the degree of Doctor of Philosophy) Recommended by the Department of Mathematics for acceptance May 1938.”
BackgroundInfluentialA Theory of Positive Integers in Formal Logic. Part I
Kleene, S. C. (1935) · American Journal of Mathematics · doi:10.2307/2372027 · Cited by 140
Formal definitions in the theory of ordinal numbers
Church, A., & Kleene, S. C. (1937) · Fundamenta Mathematicae · doi:10.4064/fm-28-1-11-21 · Cited by 117
The constructive second number class
Church, A. (1938) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1938-06720-1 · Cited by 91
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
Gödel Theorems for Non-Constructive Logics
Rosser, B. (1937) · Journal of Symbolic Logic · doi:10.2307/2266293 · Cited by 56
Cited by
Muggleton, S. (1991) · New Generation Computing · doi:10.1007/bf03037089 · Cited by 1,044
Recursively enumerable sets of positive integers and their decision problems
Post, E. L. (1944) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1944-08111-1 · Cited by 872
Internalization theory for the digital economy
Banalieva, E. R., & Dhanaraj, C. (2019) · Journal of International Business Studies · doi:10.1057/s41267-019-00243-7 · Cited by 450
Computing with Spiking Neuron Networks
Paugam-Moisy, H., & Bohte, S. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_10 · Cited by 272
Soare, R. I. (1996) · Bulletin of Symbolic Logic · doi:10.2307/420992 · Cited by 268
Metadata
- Venue
- Mathematical Logic
- Publisher
- Elsevier
- Published
- 2001
- Pages
- 71-148
- OpenAlex
- W1970654545
- Cited by
- 543
- References
- 18
- FWCI
- 44.70
- 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.