On notation for ordinal numbers
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“For any total computable function f:N→N, there exists an index (source code) e such that φe≃φf(e).”
From Self-Referential Introspection in Large Language Models: The Critical Threshold for Recursive Self-Improvement (2026) · cites this paper as [37]
In the citing paper
“This isomorphism between self-reproducing automaton and Quine is not contingent. The deeper mathematical foundation for self-reference in computation is provided by Kleene’s Second Recursion Theorem [23,37].”
From Self-Referential Introspection in Large Language Models: The Critical Threshold for Recursive Self-Improvement (2026) · cites this paper as [37]
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
An Unsolvable Problem of Elementary Number Theory
Church, A. (1936) · American Journal of Mathematics · doi:10.2307/2371045 · Cited by 1,763
General recursive functions of natural numbers
Kleene, S. C. (1936) · Mathematische Annalen · doi:10.1007/bf01565439 · Cited by 593
Self-citationOn undecidable propositions of formal mathematical systems
Gödel, K., Kleene, S. C., & Rosser, J. B. (1934) · Medical Entomology and Zoology · Cited by 401
Self-citationλ-definability and recursiveness
Kleene, S. C. (1936) · Duke Mathematical Journal · doi:10.1215/s0012-7094-36-00227-2 · Cited by 267
Self-citationFormal 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
Self-citationThe constructive second number class
Church, A. (1938) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1938-06720-1 · Cited by 91
Research works printed but not linked: 1
- 1937, Computability and λ-definability, 2, 163
Cited by
Items 701–800 of 909
The Algebraic Properties of if-then-else with Commutative Three-Valued Tests
Su, R. C.-W. (2018) · Research Commons (University of Waikato)
Computer implementation of a chosen version of strong belief logic
Kopański, P., MULAWKA, J. J., & Wesserling, J. (2018) · Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments (WILGA) · doi:10.1117/12.2500605
Algebraic properties of if-then-else and commutative three-valued tests
Soo, K.-U., & Stokes, T. (2019) · International Journal of Algebra and Computation · doi:10.1142/s0218196719500255
Sequent-Type Proof Systems for Three-Valued Default LogicPreprint
Pkhakadze, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.04725
Formal Verification of Three-Valued Digital Waveforms
Kutsak, N. Y., & Podymov, V. V. (2020) · Automatic Control and Computer Sciences · doi:10.3103/s0146411620070135
Advances and Applications of Dezert-Smarandache Theory (DSmT), Vol. 1
Smarandache, F., & Dezert, J. (2004) · UNM’s Digital Repository (University of New Mexico)
Contextualism and the Sorites Paradox
Bones, I., & Raffman, D. (2019)
Servos, D. (2020) · Scholarship@Western (Western University)
Cantor–Bendixson ranks of effectively closed sets in admissible recursion theory
Johnston, R. (2020) · Computability · doi:10.3233/com-180187
Ordinal Recursion TheoryPreprint
Chong, C. T., & Friedman, S. D. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.math/9609203
Willard, D. E. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.01057
Coinduction Plain and SimplePreprint
Bry, F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.09909
A Paraconsistent ASP-like Language with Tractable Model GenerationPreprint
Szałas, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.09715
… and so on: Schütte on Naming Ordinals
Crossley, J. N. (2020) · Springer eBooks · doi:10.1007/978-3-030-49424-7_3
Belief change and 3-valued logics: Characterization of 19,683 belief change operators
Borges, N., & Pérez, R. P. (2020) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12091
Sequent-type calculi for variants of default logic
Pkhakadze, S. (2019) · reposiTUm (TU Wien) · doi:10.34726/hss.2019.47663
Dialetheism and the Sorites Paradox
Jinhee, L. (2019) · Korean Journal of Logic · doi:10.22860/kafl.2019.22.1.87
Assertions of counterfactuals and epistemic irresponsibility
Morato, V. (2021) · Padua Research Archive (University of Padova)
“AD plus Uniformization” is equivalent to “Half ADR”
Kechris, A. S. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.003
The blockchain potential in computer virology: leveraging combinatorial techniques of k-ary codes
Moubarak, J., Filiol, É., & Chamoun, M. (2021) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-021-00389-9
Mathematical works of Vladimir A. Uspensky: A commentaryPreprint
Shen', A. K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.02773
An Introduction to Theory of Graded Consequence: A Non-standard Many-Valued Approach to Logic
Chakraborty, M. K., & Basu, S. (2020) · Springer eBooks · doi:10.1007/978-81-322-1812-8_45-1
Устранение операторов прошлого в троичной логике линейного времени на конечных трассах
Kutsak, N. Y., & Podymov, V. V. (2021) · Международная научно-практическая конференция «Актуальные проблемы науки и образования в условиях современных вызовов» · doi:10.26456/mfcsics-21-27
Syropoulos, A., & Grammenos, T. (2020) · Wiley eBooks · doi:10.1002/9781119445326.biblio
Chapter XXV Ordinal Numbers and Predicative Set Theory
(1963) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71865-2
(1958) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70009-6
Annual Meeting of the Australasian Association for Logic
(1992) · Journal of Symbolic Logic · doi:10.2307/2275389
Steel, J. R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.010
Contextualism and the Sorites Paradox
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.004
Rejection of Excluded Middle and the Sorites Paradox
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.007
Subsets of ℵ1 constructible from a real
Kechris, A. S. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.007
Kechris, A. S., Löwe, B., & Steel, J. R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.001
Kechris, A. S., Löwe, B., & Steel, J. R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.014
Intuitionism and the Sorites Paradox
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.006
Foreman, M. D. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.012
Some consistency results in ZFC using AD
Woodin, W. H. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.006
Dellacherie, C. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.011
The Semantic View of Computation
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.003.0008
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.003.0011
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.003.0003
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.003.0001
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.003.0010
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.003.0007
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.003.0006
Computation as Step-Satisfaction
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.003.0005
Desiderata of a Theory of Computation
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.003.0002
An Argument for the Semantic View
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.003.0009
Preamble to Machine Computation
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.003.0004
Normalisation for Some Infectious Logics and Their Relatives
Игоревич, П. Я. (2022) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.358.2
Lobina, D. J. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.003.0008
(1953) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70115-6
Doctorales 2016: Résumés des Doctorales de Philosophie (2016)
(2017) · Philonsorbonne · doi:10.4000/philonsorbonne.887
References and Index to References
(1980) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71147-9
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.017
The derivations into the interfaces
Lobina, D. J. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.003.0004
(1989) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70326-4
Lobina, D. J. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.003.0002
(1981) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70884-x
Position Papers of the 2016 Federated Conference on Computer Science and Information Systems
(2016) · Annals of Computer Science and Information Systems · doi:10.15439/978-83-60810-93-4
Lobina, D. J. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.003.0006
Chapter XXIII The Formalization of Mathematics
(1963) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71863-9
(1992) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70025-9
(1961) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71162-5
Robust Network Services with Distributed Code Rewriting
Meyer, T. A., & Tschudin, C. (2011) · IGI Global eBooks · doi:10.4018/978-1-61350-092-7.ch003
(2000) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(00)80022-1
1994–1995 Winter Meeting of the Association for Symbolic Logic
(1995) · Bulletin of Symbolic Logic · doi:10.2307/421164
(1967) · Elsevier eBooks · doi:10.1016/b978-1-4832-3123-5.50013-6
Seuren, P. A. M. (2006) · Elsevier eBooks · doi:10.1016/b0-08-044854-2/01102-0
The universality and uniqueness of recursion-in-language
Lobina, D. J. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.003.0005
Lobina, D. J. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.003.0001
The early history of formal diagonalization
Smoryński, C. (2022) · Logic Journal of IGPL · doi:10.1093/jigpal/jzac054
Local higher-order fixpoint iteration
Bruse, F., Kreiker, J., Lange, M., & Sälzer, M. (2022) · Information and Computation · doi:10.1016/j.ic.2022.104963
Li, W., & Sui, Y. (2022) · Perspectives in formal induction revision and evolution · doi:10.1007/978-981-19-4270-9_3
Li, W., & Sui, Y. (2022) · Perspectives in formal induction revision and evolution · doi:10.1007/978-981-19-4270-9_1
Cupping in the computably enumerable degrees
Tran, H. H. (2023) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/165558
An Analysis of the Continuum HypothesisPreprint
Powell, A. (2023) · doi:10.32388/wnnnt7
An Analysis of the Continuum HypothesisPreprint
Powell, A. (2023) · doi:10.32388/wnnnt7.2
An Analysis of the Continuum HypothesisPreprint
Powell, A. (2023) · doi:10.32388/wnnnt7.4
An Analysis of the Continuum HypothesisPreprint
Powell, A. (2023) · doi:10.32388/wnnnt7.3
An Analysis of the Continuum HypothesisPreprint
Powell, A. (2023) · doi:10.32388/wnnnt7.5
An Analysis of the Continuum HypothesisPreprint
Powell, A. (2023) · doi:10.32388/wnnnt7.6
An Analysis of the Continuum HypothesisPreprint
Powell, A. (2023) · doi:10.32388/wnnnt7.7
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.002.0007
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.002.0008
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.002.0004
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.002.0012
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.002.0005
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.002.0011
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.002.0010
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.002.0013
An Analysis of the Continuum HypothesisPreprint
Powell, A. (2023) · Qeios · doi:10.32388/wnnnt7.8
A classification of low c.e. sets and the Ershov hierarchy
Faĭzrahmanov, M. K. (2023) · Mathematical logic quarterly · doi:10.1002/malq.202300020
Pavlović, D. (2023) · Theory and applications of computability · doi:10.1007/978-3-031-34827-3_6
Pavlović, D. (2023) · Theory and applications of computability · doi:10.1007/978-3-031-34827-3_3
Finitely and Infinitely Valued Logics
Polkowski, L. (2023) · Intelligent systems reference library · doi:10.1007/978-3-031-42034-4_6
Shagrir, O. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780197552384.002.0004
Jaką postać mogłoby mieć rozwiązanie paradoksu sorites przez Bertranda Russella?
Nowak, M. (2022) · Przegląd Filozoficzny - Nowa Seria · doi:10.24425/pfns.2022.143324
(2003) · Oxford University Press eBooks · doi:10.1093/oso/9780198500735.003.0024
Metadata
- Authors
- Kleene, S. C.
- Corresponding author
- Kleene, S. C.
- Venue
- Journal of Symbolic Logic
- Publisher
- Cambridge University Press (CUP)
- 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.