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 801–900 of 909
(2003) · Oxford University Press eBooks · doi:10.1093/oso/9780198500759.003.0036
Fixed point properties of numbered familiesPreprint
Faĭzrahmanov, M. K. (2023) · OSF Preprints (OSF Preprints) · doi:10.31219/osf.io/tmg9s
Withdrawn: Fixed Point Properties of Precompletely and Positively Numbered SetsPreprint
Faĭzrahmanov, M. K. (2023) · Preprints.org · doi:10.20944/preprints202312.1276.v1
Li, W., & Sui, Y. (2024) · Perspectives in formal induction revision and evolution · doi:10.1007/978-981-99-6460-4_1
The Genesis of Mix: Early Days of Self-Applicable Partial Evaluation (Invited Contribution)
Sestoft, P., & Søndergaard, H. (2024) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/3635800.3637445
Semantic Closure and Classicality
Bezerra, E. (2023) · Revista de Humanidades de Valparaíso · doi:10.22370/rhv2023iss22pp85-103
Propositional Type Theory of Indeterminacy
Aranda, V., Martins, M. A., & Manzano, M. (2024) · Studia Logica · doi:10.1007/s11225-024-10099-0
Wagemann, J. (2024) · Adaptive Behavior · doi:10.1177/10597123241263607
Skapinakis, E. (2024) · Information and Computation · doi:10.1016/j.ic.2024.105196
Modalidades bivalentes e modalidades polivalentes: o caso das lógicas modais trivaloradas
Bezerra, E. (2024) · Filosofia Unisinos · doi:10.4013/fsu.2024.252.02
Exploring the philosophical perspectives of future robots
Guilherme, A., & Costa, J. F. (2024) · International Journal of Parallel Emergent and Distributed Systems · doi:10.1080/17445760.2024.2392604
О трехзначных логиках, сохраняющих промежуточное значение
Девяткин, Л. Ю. (2024) · Логико-философские штудии · doi:10.52119/lphs.2024.13.41.003
Operators in the mind: Jan Lukasiewicz and Polish notationPreprint
Mizraji, E. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2501.07660
Constructive Ordinal ExponentiationPreprint
de Jong, T., Kraus, N., Forsberg, F. N., & Xu, C. (2025) · Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) · doi:10.48550/arxiv.2501.14542
Lógica trivalorada e paraconsistência em Peirce
Salatiel, J. R. (2025) · Cognitio Revista de Filosofia · doi:10.23925/2316-5278.2025v26i1:e57507
An Analysis of the Continuum Hypothesis
Powell, A. (2025) · Axioms · doi:10.3390/axioms14030154
Towards the Relating Pragmatics: The Case of Conjunction
Palczewski, R. (2025) · Roczniki Filozoficzne · doi:10.18290/rf25731.9
Metaphilosophy and Meta-Methodology
Weinberg, J. M., & Alexander, J. (2025) · Oxford University Press eBooks · doi:10.1093/9780191947704.003.0002
Putting Philosophy Back On Its Feet
Weinberg, J. M., & Alexander, J. (2025) · Oxford University Press eBooks · doi:10.1093/9780191947704.003.0007
Experimental Philosophy and Philosophical Progress
Weinberg, J. M., & Alexander, J. (2025) · Oxford University Press eBooks · doi:10.1093/9780191947704.003.0006
The Standard Normative Framework and the Unreliability of ‘Reliability’
Weinberg, J. M., & Alexander, J. (2025) · Oxford University Press eBooks · doi:10.1093/9780191947704.003.0003
Weinberg, J. M., & Alexander, J. (2025) · Oxford University Press eBooks · doi:10.1093/9780191947704.003.0001
A Better Normative Framework: Methodological Rationality
Weinberg, J. M., & Alexander, J. (2025) · Oxford University Press eBooks · doi:10.1093/9780191947704.003.0004
On the Interpretation of Denotational Semantics
Cardone, F. (2025) · Philosophies · doi:10.3390/philosophies10030054
Classical Implication for Three-Valued Logic
Li, Z., & Naumov, P. (2025) · Journal of Logic Language and Information · doi:10.1007/s10849-025-09436-w
Normal Forms and Decompositions of Monotone Ternary Functions
Schneider, K., & Kercher, N. (2025) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl64713.2025.00039
Fuzzy Arden Syntax Connectives in Clinical Medicine
Grob, M., Liepold, J., Hauptfeld, L., Weich, C., Крейнович, В., Jenders, R. A., & Adlassnig, K.-P. (2025) · Studies in health technology and informatics · doi:10.3233/shti250668
Resolving Radzki’s issues with Łukasiewicz logics’ axiomatics via correspondence analysis
Игоревич, П. Я., & Shangin, V. (2025) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.2025.2518839
Ordinal Folding Index: A Computable Metric for Self-Referential SemanticsPreprint
Alpay, F., & Alakkad, H. (2025) · doi:10.22541/au.175346092.28261233/v1
On the regularity of the language of some T-ideals
Centrone, L., Kanel-Belov, A., & Scala, R. L. (2025) · Linear Algebra and its Applications · doi:10.1016/j.laa.2025.08.002
Recursion Theorems in Numbered Sets
Faĭzrahmanov, M. K. (2025) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054125500248
Computable Structure Theory: Jump of Structure, Coding and Decoding
Soskova, A. A. (2021) · doi:10.60063/dsc.aas.2021.en
On the Computability of Finding Capacity-Achieving CodesPreprint
Gkekas, A., Mitsiou, N. A., Souldatos, I., & Karagiannidis, G. K. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2511.01414
Controller synthesis using interval methods
Kootstra, P. (2014) · Research Repository (Delft University of Technology)
The metaphysics of properties and relations
Hong, K. (2024) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.5287/ora-erwq17ddk
Truth, paradoxes, and partiality
Rossi, L. (2015) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.5287/ora-obe2z89vk
Gkountakou, F. I., & Papadopoulos, B. (2024) · Figshare · doi:10.6084/m9.figshare.26610510
The limitations of formal systems
Busch, D. R. (1968) · UNSWorks (University of New South Wales, Sydney, Australia) · doi:10.26190/unsworks/7792
Algebraic and coalgebraic modal logic: From Boolean algebras to semi-primal varieties
Poiger, W. (2024) · Open Repository and Bibliography (University of Luxembourg)
Formalizing GADT constraint reasoning in Scala
Bucev, M. (2021) · Infoscience (Ecole Polytechnique Fédérale de Lausanne)
HTLC: Hyperintensional Typed Lambda Calculus
Primiero, G. (2021) · Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano)
Normality operators and Classical Recapture in Extensions of Kleene Logics
Roberto, C., & Carrara, M. (n.d.) · PhilPapers (PhilPapers Foundation)
Natural Deduction Rules for Tomova’s Natural Implications
Shangin, V., & Игоревич, П. Я. (2018) · Logical and philosophical studies (Saint Petersburg State University)
Математические работы Владимира Андреевича Успенского: комментарии (английский и русский текст)
Shen', A. K. (2020) · HAL
Three Arguments based on Ordinals against Computationalism
Cabañero, L. L. (2017) · Deposito de Investigacion Universidad de Sevilla (University of Seville)
Böhm, M. (2024) · eScholarship (California Digital Library)
New perspectives on some non-classical logical systems
Skurt, D. (2018) · Dokumentenrepositorium der RUB (Ruhr University Bochum)
Hertum, P. V. (2016) · Lirias
The things before us: On what it is to be an object
Booij, E. J. (2021) · UvA-DARE (University of Amsterdam)
Connecting constructive notions of ordinals in homotopy type theory
Forsberg, F. N., Xu, C., & Kraus, N. (2021) · Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)
Kelsch, J. (2019) · Carl von Ossiezky University of Oldenburg
Marco de testing metamórfico para consultas SQL con valores nulos
Machado Salazar, G. (2020) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)
A Kleene Theorem and Decision Problems for Probability and Angelic Nondeterminism
Ong, S. (2025) · eCommons (Cornell University) · doi:10.7298/1bxz-wj13
Efficient Data Systems for Scalable Analysis with Large Language Models
Jo, S. (2025) · eCommons (Cornell University) · doi:10.7298/6nyf-az27
Bruhacs, L. (2025) · PhilPapers (PhilPapers Foundation) · doi:10.5281/zenodo.17342896
Ignorance as an excuse, formallyPreprint
Kubyshkina, E., Pereira, M. K., & Petrolo, M. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2511.02942
Bogaerts, B., Vennekens, J., & Denecker, M. (2014) · Lirias
Reasoning With Multi-Valued Logic in the Field of Security Education
Kucherov, M. M., Вайнштейн, В. И., & Shimanovich, R. (2025) · Dynamics of Systems Mechanisms and Machines · doi:10.1109/dynamics68764.2025.11302173
Efficiently Ensuring Traffic Rule Compliance of Motion Plans by Incorporating Scenario Knowledge
Lercher, F., Reisenberg, P., & Althoff, M. (2025) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2025.3645702
Gogoa, R. (2009) · Gogoa · doi:10.1387/gogoa.3552
The Effects of Concatenation: Jean Cavaillès and Mathematical Philosophy
Hare, M. (2025) · PhilPapers (PhilPapers Foundation)
Wider systems for linear logic with fixed points: proof theory and complexityPreprint
Das, A., & Pshenitsyn, T. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.10280
Generalized Decidability via Brouwer Trees
de Jong, T., Kraus, N., Mohammadzadeh, A., & Forsberg, F. N. (2026) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.lics.2026.59
Accounts of Computation in Physical Systems
Hall, J. S. (2024) · TSpace (University of Toronto)
Lucas, S. (2026) · Journal of Logical and Algebraic Methods in Programming · doi:10.1016/j.jlamp.2026.101112
Vers une structure fine des calculabilités
Givors, F. (2013) · theses.fr (ABES) · doi:10.70675/9629bc92z5c0cz4dcaz8446z4c53bc83b758
Réflexion, calculs et logiques
Godfroy, H. (2017) · theses.fr (ABES) · doi:10.70675/09fd692azb1d3z48e7z90b3z33e8b3f2f9ed
Fine-Grained and Parameterized Complexity of Graph Coloring Problems
Baril, A. (2024) · theses.fr (ABES) · doi:10.70675/5842ba53z380ez4b64z9aeczdee2a5b2e32f
Bringsjord, S., & Govindarajulu, N. S. (2026) · Studies in computational intelligence · doi:10.1007/978-3-032-06573-5_10
Designing a Universal Information Language
Bender-Stone, O. (2026) · CU Scholar (University of Colorado Boulder)
A validity theory for the ST-hierarchy
Barrio, E. A., Bezerra, E., & Pailos, F. M. (2026) · Logic Journal of IGPL · doi:10.1093/jigpal/jzag035
Recursive Jump Operators and Optimal Proof Systems
Egidy, F. (2026) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2026.88
Elusive but Coverable: The Recursion-Theoretic Structure of Complete Abstract InterpretationsPreprint
Carpenter, N., & Giacobazzi, R. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.09128
Essence and Accident Modalities Meet Belnapian Truth Values
Игоревич, П. Я. (2026) · Studia Logica · doi:10.1007/s11225-026-10250-z
Prescriptive Logic as a Tool of Cognition. A Formal Framework for Model Dynamics
Grigoriev, P. E. (2026) · Общество философия история культура · doi:10.24158/fik.2026.6.2
Subreflexive Logic: Completeness without IdentityPreprint
Wafa, N. A. E., & Platzer, A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.24623
Characterization of the solvability of bipolar equations
López-Molina, P. (2026) · RODIN (Universidad de Cádiz)
The gate of self-address: where decidable adjudication endsPreprint
Sifnaios, P. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.29576
Nagler, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.02654
Bootstrapping Mutual Attestation with Kleene's Second Recursion TheoremPreprint
Imamura, T. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.20671
Metamorphism: A mathematical challenge for antivirus technologyPreprint
Augusto, L. M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.27007
共進化モデルを用いた不良品回収制度分析のための社会シミュレーションに関する研究
Watanabe, T. (2018) · Institutional Repositories DataBase (IRDB) · doi:10.15083/00078130
Barroso, D. L. (2026) · Docta Complutense (Universidad Complutense de Madrid)
Mollakazemiha, M. (n.d.) · PhilPapers (PhilPapers Foundation)
A Mathematical Theory of Correct Computation
Naish, L., Pope, B. J., & Søndergaard, H. (2026) · Mathematics · doi:10.3390/math14183292
Podstawy matematyki bez aktualnej nieskończoności
Czarnecki, M. (2014) · ReIn UW (University of Warsaw)
Exact truth and double-rail logics
Niki, S. (2026) · Journal of Logic and Computation · doi:10.1093/logcom/exag042
Richards, B. A., & y Arcas, B. A. (2026) · Behavioral and Brain Sciences · doi:10.1017/s0140525x25103646
On Three-Valued Dependence-Like Logics
Игоревич, П. Я. (2026) · Logic and Logical Philosophy · doi:10.12775/llp.2026.016
Pimp my fixpoint: sofic realization of multidimensional substitution-based shift spacesPreprint
Callard, A., Guillon, P., Salomon, L. P., & Vanier, P. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.28207
FormalizationThe Thesis of Fused Self-Reference: A Computational Formalization
Catelani, L. G. C. (2026) · PhilPapers (PhilPapers Foundation) · doi:10.5281/zenodo.23044375
Abitare l’incomputabile. Alcune considerazioni sul programma di ricerca di Alan Turing
Turrini, N. (2025) · Scenari · doi:10.7413/24208914226
Conditionals and Probability: Special Issue
Alberto Mura, R. B., Alberto Mario, M. U. R. A., & Alberto Mario, M. U. R. A. (2021) · UnissResearch (Università degli Studi di Sassari)
Vehicles, Not Facts: First-Person Realism and List's Quadrilemma
Ness, A. (2026) · PhilPapers (PhilPapers Foundation) · doi:10.5281/zenodo.21903780
Universal Construction and Exact Self-Reproduction in Ternary McCulloch-Pitts NetworksPreprint
Norton, C. C. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.12251
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.