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 401–500 of 909
Feferman, S. (1995) · Computerkultur · doi:10.1007/978-3-7091-6597-3_4 · Cited by 4
Non Truth-Functional Many-Valuedness
Béziau, J.-Y. (2002) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)80544-9 · Cited by 4
Truth versus information in logic programming
Naish, L., & Søndergaard, H. (2013) · Theory and Practice of Logic Programming · doi:10.1017/s1471068413000069 · Cited by 4
The Method of Socratic Proofs Meets Correspondence Analysis
Leszczyńska-Jasion, D., Игоревич, П. Я., & Shangin, V. (2019) · Bulletin of the Section of Logic · doi:10.18778/0138-0680.48.2.02 · Cited by 4
Measuring the Intelligence of an Idealized Mechanical Knowing Agent
Alexander, S. A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-57506-9_13 · Cited by 4
Wave-Particle Duality and the Objectiveness of “True” and “False”
Bolotin, A. (2021) · Foundations of Physics · doi:10.1007/s10701-021-00478-1 · Cited by 4
Centrone, L., & Estrada, A. (2022) · Canadian Mathematical Bulletin · doi:10.4153/s0008439522000327 · Cited by 4
Non-transitive Correspondence Analysis
Игоревич, П. Я., & Shangin, V. (2022) · Journal of Logic Language and Information · doi:10.1007/s10849-022-09382-x · Cited by 4
Rice and Rice-Shapiro Theorems for transfinite correction grammars
Case, J., & Jain, S. K. (2011) · Mathematical logic quarterly · doi:10.1002/malq.201020054 · Cited by 4
Blanchette, J. C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13977-2_11 · Cited by 4
A comparison of identification criteria for inductive inference of recursive real-valued functions
Hirowatari, E., & Arikawa, S. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00275-9 · Cited by 4
Diagonalisation and Church's Thesis: Kleene's Homework
Alonso, E., & Manzano, M. (2005) · History and Philosophy of Logic · doi:10.1080/0144534042000271157 · Cited by 4
On Minimal and Almost-Minimal Systems of Notations
Luckham, D. C., & Putnam, H. (1965) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1965-0184852-2 · Cited by 4
Belnap’s logic and conditional composition
Alban Ponse, A., & van der Zwaag, M. B. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.09.027 · Cited by 4
Introducing Abstract Argumentation with Many Lives.
Gabbay, D. M., & Rozenberg, G. (2020) · Open Repository and Bibliography (University of Luxembourg) · Cited by 4
Local Higher-Order Fixpoint Iteration
Bruse, F., Kreiker, J., Lange, M., & Sälzer, M. (2020) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.326.7 · Cited by 4
Shadowing in Many-Valued Nested Structures
Dunin‐Kȩplicz, B., & Szałas, A. (2020) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl49045.2020.00005 · Cited by 4
A Behavior Based Approach to Virus Detection
Morales, J. A. (2008) · FIU - Digital Commons (Florida International University) · doi:10.25148/etd.fi08081536 · Cited by 4
On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency
Willard, D. E. (2005) · Lecture notes in computer science · doi:10.1007/11554554_22 · Cited by 4
Learning by switching type of information
Jain, S. K., & Stephan, F. (2003) · Information and Computation · doi:10.1016/s0890-5401(03)00082-8 · Cited by 4
On the notational independence of various hierarchies of degrees of unsolvability
Hensel, G. B., & Putnam, H. (1965) · Journal of Symbolic Logic · doi:10.2307/2270584 · Cited by 4
Unprovability and phase transitions in Ramsey theory
Smet, M. D. (2011) · Ghent University Academic Bibliography (Ghent University) · Cited by 4
Bona, L., & James, D. (2012) · TDX (Tesis Doctorals en Xarxa) · Cited by 4
Seuren, P. A. M. (1990) · Linguistics · doi:10.1515/ling.1990.28.3.503 · Cited by 4
Matrix and Embedded Presuppositions
Singh, R. R. (2020) · Wiley eBooks · doi:10.1002/9781118788516.sem132 · Cited by 4
Programs as Diagrams: From Categorical Computability to Computable CategoriesPreprint
Pavlović, D. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2208.03817 · Cited by 4
Infinite Ordered Sets, A Recursive Perspective
McNulty, G. F. (1982) · Springer eBooks · doi:10.1007/978-94-009-7798-3_9 · Cited by 4
One-variable fragments of first-order many-valued logics
Tuyt, O. (2021) · BORIS Theses (Bern Open Research Information System) (Bern University Library, Hochschulstrasse 6, 3012 Bern, Switzerland) · doi:10.48549/2864 · Cited by 4
C-Log: a knowledge representation language of causality
Bogaerts, B., Vennekens, J., Denecker, M., & Van den Bussche, J. (2014) · Lirias · Cited by 4
On the Semantics of Intensionality and Intensional RecursionPreprint
Kavvos, G. A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.09302 · Cited by 4
Modélisation formelle de systèmes dynamiques autonomes : graphe, réécriture et grammaire
Eichler, C. (2015) · theses.fr (ABES) · doi:10.70675/51f9f2e9z32b3z4b9cza510z8f41b2be09b8 · Cited by 4
Schwartz, D. G. (2000) · doi:10.15760/etd.591 · Cited by 4
Leveraging belief uncertainty for informed decision making in software product line evolution
Horcas, J.-M., Burgueño, L., & Kienzle, J. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112235 · Cited by 3
Schumann, A. (2026) · Synthese · doi:10.1007/s11229-026-05470-8 · Cited by 3
Capturing Bisimulation-Invariant Exponential-Time Complexity Classes
Bruse, F., Kronenberger, D., & Lange, M. (2022) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.370.2 · Cited by 3
Gkountakou, F. I., & Papadopoulos, B. (2023) · Journal of Engineering and Applied Science · doi:10.1186/s44147-023-00266-w · Cited by 3
PARACONSISTENT AND PARACOMPLETE ZERMELO–FRAENKEL SET THEORY
Khomskii, Y., & Oddsson, H. V. (2023) · The Review of Symbolic Logic · doi:10.1017/s1755020323000382 · Cited by 3
Fixed Point Theorems in Computability Theory
Terwijn, S. A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-61716-4_14 · Cited by 3
La historia y la gramática de la recursión: una precisión desde la obra de Wittgenstein
Mota, S. (2014) · Pensamiento y Cultura · doi:10.5294/pecu.2014.17.1.2 · Cited by 3
Four-Valued Reasoning and Cyclic Circuits
Gange, G., Horsfall, B., Naish, L., & Søndergaard, H. (2014) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2014.2304176 · Cited by 3
Classical Logic's Coming of Age
Dawson, J. W. (2007) · Elsevier eBooks · doi:10.1016/b978-044451541-4/50016-6 · Cited by 3
Bezhanishvili, G. (2009) · Mathematical Association of America eBooks · doi:10.5948/upo9780883859742.032 · Cited by 3
Willard, D. E. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-36755-8_17 · Cited by 3
HTLC: Hyperintensional typed lambda calculus
Fait, M., & Primiero, G. (2021) · DSpace VŠB-TUO (VŠB-TUO) · Cited by 3
Structuralism, indiscernibility, and physical computation
Doherty, F. T., & Dewhurst, J. (2022) · Synthese · doi:10.1007/s11229-022-03691-1 · Cited by 3
Bogaerts, B., Vennekens, J., & Denecker, M. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9388 · Cited by 3
Wen, X. (2023) · Studia Logica · doi:10.1007/s11225-023-10043-8 · Cited by 3
Case, J., & Moelius, S. E. (2009) · Cited by 3
Mota, S. (2015) · RLA. Revista de lingüística teórica y aplicada · doi:10.4067/s0718-48832015000200008 · Cited by 3
Incoherentism and the Sorites Paradox
Eklund, M. (2019) · PhilPapers (PhilPapers Foundation) · Cited by 3
Revisiting Object-Rule Fusion in Query Languages
Szałas, A. (2020) · Procedia Computer Science · doi:10.1016/j.procs.2020.08.006 · Cited by 3
Lethen, T. (2021) · The Review of Symbolic Logic · doi:10.1017/s1755020321000034 · Cited by 3
Formal Verification of Three-Valued Digital Waveforms
Kutsak, N. Y., & Podymov, V. V. (2019) · Modeling and Analysis of Information Systems · doi:10.18255/1818-1015-2019-3-332-350 · Cited by 3
Karchmer-Wigderson Games for Hazard-Free Computation
Ikenmeyer, C., Komarath, B., & Saurabh, N. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2023.74 · Cited by 3
Many-Valued Logics and Bivalent Modalities
Bezerra, E., & Venturi, G. (2022) · Logic and Logical Philosophy · doi:10.12775/llp.2022.013 · Cited by 3
Typed SLD-Resolution: Dynamic Typing for Logic Programming
Barbosa, J., Florido, M., & Costa, V. S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-16767-6_7 · Cited by 3
Presupposition projection as a scope phenomenon
Grove, J. (2022) · Semantics and Pragmatics · doi:10.3765/sp.15.15 · Cited by 3
The Catuṣkoṭi, the Saptabhaṇgī, and “Non-Classical” Logic
Priest, G. (2022) · Springer eBooks · doi:10.1007/978-81-322-2577-5_50 · Cited by 3
A reunion of Gödel, Tarski, Carnap and Rosser
Salehi, S. (2023) · Journal of Logic and Computation · doi:10.1093/logcom/exad001 · Cited by 3
Chong, C. T., & Friedman, S. D. (1999) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(99)80025-1 · Cited by 3
CONCEPTS ASSOCIATED TO CRITERIA: A METHOD FOR KNOWLEDGE PROCESSING FROM FUZZY CONTEXTS
Burusco, A., & FUENTES-GONZALEZ, R. (2002) · International Journal of Uncertainty Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001405 · Cited by 3
Logic as General Rationality: A Survey
Sales, T. (2002) · Springer eBooks · doi:10.1007/978-94-017-0464-9_6 · Cited by 3
Reflexivity and self-augmentation
Tanaka‐Ishii, K. (2010) · Semiotica · doi:10.1515/semi.2010.028 · Cited by 3
Ternary universal logic gates using quantum dot gate field effect transistors
Karmakar, S., & Jain, F. (2014) · Indian Journal of Physics · doi:10.1007/s12648-014-0583-6 · Cited by 3
Limitwise monotonic functions relative to the Kleene’s Ordinal Notation System
Frolov, A. N., & Zubkov, M. V. (2014) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080214040167 · Cited by 3
Inference in the FO(C) Modelling Language
Bogaerts, B., Vennekens, J., Denecker, M., & den Bussche, J. V. (2014) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-61499-419-0-111 · Cited by 3
On the Broader Epistemological Significance of Self-Justifying Axiom Systems
Willard, D. E. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44145-9_16 · Cited by 3
On Undefined and Meaningless in Lambda Definability
de Vries, F.-J. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.fscd.2016.18 · Cited by 3
THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
Greenberg, N., Shore, R. A., & Slaman, T. A. (2006) · Journal of Mathematical Logic · doi:10.1142/s0219061306000505 · Cited by 3
Facts and the semantics of gerunds
Martin, J. N. T. (1975) · Journal of Philosophical Logic · doi:10.1007/bf00558759 · Cited by 3
Kleene’s Amazing Second Recursion Theorem
Moschovakis, Y. N. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04027-6_5 · Cited by 3
Klev, A. M. (2007) · Cited by 3
Jansen, J., Bogaerts, B., Devriendt, J., Janssens, G., & Denecker, M. (2016) · Lirias · Cited by 3
El problema onomástico para los ordinales numerables
Martínez, J. A. D. R. (1984) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Cited by 3
Signed Dual Tableaux for Kleene Answer Set Programs
Doherty, P., & Szałas, A. (2018) · Outstanding contributions to logic · doi:10.1007/978-3-319-97879-6_9 · Cited by 3
Ternary Logic Flip-Flops Using Quantum Dot Gate Field Effect Transistor (QDGFET)
Karmakar, S. (2022) · Silicon · doi:10.1007/s12633-022-01949-4 · Cited by 3
The power of parallelism for automatic program synthesis
Smith, C. H. (1981) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1981.48 · Cited by 3
Mind Change Complexity of Learning Logic Programs
Jain, S. K., & Sharma, A. (n.d.) · Cited by 3
Non-Monotonic Logics for Access Control: Delegation Revocation and Distributed Policies
Ambrossio, D. A. (2017) · Open Repository and Bibliography (University of Luxembourg) · Cited by 3
V1: A Visual Query Language for Property GraphsPreprint
Kogan, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.04470 · Cited by 3
A calculus for sequential logic with 4 values
Bergstra, J. A., & Pol, V. D. J. (1996) · Logic Group preprint series · Cited by 3
Correspondence Analysis for Some Fragments of Classical Propositional Logic
Игоревич, П. Я., & Shangin, V. (2021) · Logica Universalis · doi:10.1007/s11787-021-00267-4 · Cited by 3
Separation of PSPACE and EXPPreprint
Czerwinski, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.14316 · Cited by 3
Fixpoints of types in linear logic from a Curry-Howard-Lambek perspective
Jafarrahmani, F. (2023) · theses.fr (ABES) · doi:10.70675/6c68e980z198bz4454zb54fze4709ddc5326 · Cited by 3
Coreferentie van atomaire en complexe objecten
Bronselaer, A. (2010) · Ghent University Academic Bibliography (Ghent University) · Cited by 3
Zhang, J., Yuan, B., & Zhang, Q. (2026) · Entropy · doi:10.3390/e28090951 · Cited by 2
The fourteen Victoria Delfino problems and their status in the year 2020
Caicedo, A. E., & Low, B. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.013 · Cited by 2
Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures
Bruse, F., Sälzer, M., & Lange, M. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.mfcs.2021.24 · Cited by 2
Uniform Cut-Free Bisequent Calculi for Three-Valued Logics
Indrzejczak, A., & Игоревич, П. Я. (2024) · Logic and Logical Philosophy · doi:10.12775/llp.2024.019 · Cited by 2
Karniel, A., & Kaminski, M. (2024) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.415.13 · Cited by 2
Xiao, N. (2025) · Annals of the American Association of Geographers · doi:10.1080/24694452.2025.2490542 · Cited by 2
Intent-Based Management for Network Automation
Dzeparoska, K., & Leon‐Garcia, A. (2025) · IEEE/IFIP Network Operations and Management Symposium (NOMS) · doi:10.1109/noms57970.2025.11073734 · Cited by 2
Castronovo, L., Filippone, G., Rosa, G. L., Sanfilippo, G., & Tabacchi, M. E. (2026) · Mathematics · doi:10.3390/math14050778 · Cited by 2
Islam, M. F. (2026) · PhilPapers (PhilPapers Foundation) · doi:10.5281/zenodo.22735235 · Cited by 2
Infinite time extensions of Kleene’s $${\mathcal{O}}$$
Klev, A. M. (2009) · Archive for Mathematical Logic · doi:10.1007/s00153-009-0146-2 · Cited by 2
Procedural Semantics and its Relevance to Paradox
Booij, E. (2023) · Logic and Logical Philosophy · doi:10.12775/llp.2023.015 · Cited by 2
Strictly Monotone Brouwer Trees for Well Founded Recursion over Multiple Arguments
Eremondi, J. (2024) · ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP) · doi:10.1145/3636501.3636948 · Cited by 2
Some properties of precompletely and positively numbered sets
Faĭzrahmanov, M. K. (2024) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2024.103523 · Cited by 2
Is there a neutral metalanguage?
Golan, R. (2019) · Synthese · doi:10.1007/s11229-018-02078-5 · Cited by 2
NONCLASSICAL LOGICS IN RULE-BASED SYSTEM VERIFICATION PROBLEM
Nitezhuk, M. S., & Аршинский, Л. В. (2020) · Информационные и математические технологии в науке и управлении · doi:10.38028/esi.2020.18.2.003 · Cited by 2
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.