CoChat

On notation for ordinal numbers

Kleene, S. C. · 1938 · Journal of Symbolic Logic

The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.

Abstract

Consider a system of formal notations for ordinal numbers in the first and second number classes, with the following properties. Given a notation for an ordinal, it can be decided effectively whether the ordinal is zero, or the successor of an ordinal, or the limit of an increasing sequence of ordinals. In the second case, a notation for the preceding ordinal can be determined effectively. In the third case, notations for the ordinals of an increasing sequence of type ω with the given ordinal as limit can be determined effectively. Are there systems of this sort which extend farthest into the second number class? When the conditions for the systems have been made precise, the question will be answered in the affirmative. There is an ordinal ω 1 in the second number class such that there are systems of notations of the sort described which extend to all ordinals less than ω 1, but none in which ω 1 itself is assigned a notation. 1. An effective or constructive operation on the objects of an enumerable class is one for which a fixed set of instructions can be chosen such that, for each of the infinitely many objects (or n-tuples of objects), the operation can be completed by a finite process in accordance with the instructions. This notion is made exact by specifying the nature of the process and set of instructions. It appears possible to do so without loss of generality.

Overview

Integrity signals

Registry

Crossref · 10.2307/2267778

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 7 references

Research works printed but not linked: 1

  1. 1937, Computability and λ-definability, 2, 163

Cited by

Items 901–909 of 909

Metadata

Authors
Kleene, S. C.
Corresponding author
Kleene, S. C.
Venue
Journal of Symbolic Logic
Published
1938-12
Volume
3
Issue
4
Pages
150-155
ISSN
  • 0022-4812 (ISSN-L)
  • 1943-5886
OpenAlex
W2036869460
Cited by
758
References
7
Citations by year
2026: 12 · 2025: 28 · 2024: 29 · 2023: 37 · 2022: 39 · 2021: 30 · 2020: 40 · 2019: 44 · 2018: 21 · 2017: 45 · 2016: 29 · 2015: 28 · 2014: 35 · 2013: 14 · 2012: 21
FWCI
0.00
Type
journal article
Language
en
Open access
closed
Locations
  • Journal of Symbolic Logic (publishedVersion)
  • Project Euclid (Cornell University) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
  • Physical Sciences › Mathematics › Geometry and Topology › Advanced Topology and Set Theory
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
Keywords
ordinal notations, limit ordinals, omega_1, ordinal arithmetic

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.