The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Hierarchies of number-theoretic predicates
Open accessAbstract
The existence of hierarchies of point sets in analysis has long been familiar from the work of Borel and Lusin.The study of the hierarchies in number theory which we consider here began with a theorem presented to the Society in 1940 and published in [12], These hierarchies have applications in foundational investigations, but we shall be concerned here with the exploration of their structure (using classical logic).We shall survey the previous results from the beginning, and conclude with a few new ones.We have endeavored to make the exposition complete enough so that the layman in this field can get the gist of the arguments without consulting the references.
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
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
Cited by
Soare, R. I. (1996) · Bulletin of Symbolic Logic · doi:10.2307/420992 · Cited by 268
Metadata
- Authors
- Kleene, S. C.
- Venue
- Bulletin of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1955
- Volume
- 61
- Issue
- 3
- Pages
- 193-213
- ISSN
- 0002-9904 (ISSN-L)
- 0273-0979
- 1088-9485
- OpenAlex
- W1996932891
- Cited by
- 170
- References
- 2
- FWCI
- 8.22
- Type
- journal article
- Language
- en
- Open access
- diamond
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: Hierarchies of number-theoretic predicates. https://app.cochat.ai/papers/10.1090/s0002-9904-1955-09896-3
- The paper
- Kleene, S. C. (1955). Hierarchies of number-theoretic predicates. Bulletin of the American Mathematical Society. https://doi.org/10.1090/s0002-9904-1955-09896-3
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.