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 601–700 of 909
A Pragmatic Dissolution of Curry’s Paradox
Ramírez, R. F. M. (2022) · Logica Universalis · doi:10.1007/s11787-022-00294-9 · Cited by 1
Degree Theory and the Sorites Paradox
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.009 · Cited by 1
The Sorites Paradox in Linguistics
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.014 · Cited by 1
The Sorites Paradox in Metaphysics
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.012 · Cited by 1
Recursive generation in language
Lobina, D. J. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.003.0003 · Cited by 1
An Introduction to Theory of Graded Consequence: A Non-standard Many-Valued Approach to Logic
Chakraborty, M. K., & Basu, S. (2022) · Springer eBooks · doi:10.1007/978-81-322-2577-5_45 · Cited by 1
On New Notions of Algorithmic Dimension, Immunity, and Medvedev Degree
Webb, D. J. (2022) · Bulletin of Symbolic Logic · doi:10.1017/bsl.2022.33 · Cited by 1
On diagonal functions for equivalence relations
Badaev, S. A., Bazhenov, N. A., Kalmurzayev, B. S., & Mustafa, M. (2023) · Archive for Mathematical Logic · doi:10.1007/s00153-023-00896-0 · Cited by 1
On the three-valued expansions of Kleene's logic
Девяткин, Л. Ю. (2023) · Logical Investigations · doi:10.21146/2074-1472-2023-29-2-59-88 · Cited by 1
Modeling and shadowing paraconsistent BDI agents
Dunin‐Kȩplicz, B., & Szałas, A. (2023) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-023-09902-w · Cited by 1
Moss, L. S. (2023) · Electronic Notes in Theoretical Informatics and Computer Science · doi:10.46298/entics.12320 · Cited by 1
Truthmakers and Relevance for FDE, LP, K3, and CL
Verdée, P. (2023) · Outstanding contributions to logic · doi:10.1007/978-3-031-29415-0_13 · Cited by 1
Computer-Aided Searching for a Tabular Many-Valued Discussive Logic—Matrices
Jukiewicz, M., Nasieniewski, M., Игоревич, П. Я., & Shangin, V. (2024) · Logic Journal of IGPL · doi:10.1093/jigpal/jzae080 · Cited by 1
Handling Null Values in SQL Queries on Relational Databases
Méndez, M., Merayo, M. G., & Chittayasothorn, S. (2024) · International Conference on Engineering, Applied Sciences, and Technology (ICEAST) · doi:10.1109/iceast61342.2024.10553913 · Cited by 1
Three-valued generalizations of classical logic in weak languages: the degree of maximality
Девяткин, Л. Ю. (2024) · Logical Investigations · doi:10.21146/2074-1472-2024-30-2-44-71 · Cited by 1
Computational Argumentation: a Foundation for Human-centric AI
(2024) · Frontiers research topics · doi:10.3389/978-2-8325-5687-0 · Cited by 1
A Demo of ConfigFix: Semantic Abstraction of Kconfig, SAT-based Configuration, and DIMACS Export
Gyimah, J., Sollmann, J., Schuerks, O., Franz, P., & Berger, T. (2025) · International Workshop on Variability Modelling of Software-Intensive Systems (VaMoS) · doi:10.1145/3715340.3715445 · Cited by 1
Turtles All the Way Down? Recursion and Infinity in the Human Sciences
Rudolph, L. (2015) · Emerald Group Publishing Limited eBooks · doi:10.1108/978-1-68123-020-720251003 · Cited by 1
Three-Valued Plurivaluationism and the Higher-Order Vagueness
Štěpánek, J. (2019) · Hrčak Portal of scientific journals of Croatia (University Computing Centre) · Cited by 1
Connecting Constructive Notions of Ordinals in Homotopy Type Theory
Kraus, N., Forsberg, F. N., & Xu, C. (2021) · Repository@Nottingham (University of Nottingham) · Cited by 1
Effectivity Questions for Kleene’s Recursion Theorem
Case, J., Jain, S. K., & Stephan, F. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35722-0_7 · Cited by 1
A three-valued logic for refinement
Grundy, J. (2006) · Springer eBooks · doi:10.1007/bfb0039698 · Cited by 1
Noncomparabilities & Nonstandard LogicsPreprint
Hockett, R. C. (2006) · SSRN Electronic Journal · doi:10.2139/ssrn.931042 · Cited by 1
Learning by Switching Type of Information
Jain, S. K., & Stephan, F. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45583-3_17 · Cited by 1
Convergence of Expected Utilities with Algorithmic Probability DistributionsPreprint
de Blanc, P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0712.4318 · Cited by 1
Four types of general recursive well-orderings.
Liu, S. C. (1962) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093957150 · Cited by 1
On a Generalized Notion of Mistake Bounds
Jain, S. K., & Sharma, A. (2001) · Information and Computation · doi:10.1006/inco.2000.3001 · Cited by 1
Recognizing the most effective approximate reasoning calculi for a knowledge-based system
Mazlack, L. J., Lee, W., & Pick, R. A. (2002) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.1991.184163 · Cited by 1
Perspectives in multiple-valued logic
Schmitt, P. H. (1990) · Lecture notes in computer science · doi:10.1007/3-540-53082-7_24 · Cited by 1
Ordinal Notations in Caucal HierarchyPreprint
Pakhomov, F. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.05036 · Cited by 1
Inference in the FO(C) Modelling LanguagePreprint
Bogaerts, B., Vennekens, J., Denecker, M., & den Bussche, J. V. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.6368 · Cited by 1
Modelling Constrained Dynamic Software Architecture with Attributed Graph Rewriting SystemsPreprint
Eichler, C., Thierry Monteil, A., & Stolf, P. (2012) · HAL · Cited by 1
Willard, D. E. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.04717 · Cited by 1
A Query-Driven Decision Procedure for Distributed Autoepistemic Logic with Inductive DefinitionsPreprint
Ambrossio, D. A., & Cramer, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.04010 · Cited by 1
Learning programs with an easy to calculate set of errors
Gasarch, W. I., Sitaraman, R. K., Smith, C. H., & Velauthapillai, M. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51734-0_55 · Cited by 1
Hermes, H. (1981) · Springer eBooks · doi:10.1007/978-94-009-9056-2_11 · Cited by 1
Seuren, P. A. M. (2006) · Elsevier eBooks · doi:10.1016/b0-08-044854-2/01104-4 · Cited by 1
Uma análise das bivalorações do ponto de vista da semântica de sociedades
Bezerra, E. V. (2017) · doi:10.47749/t/unicamp.2017.989939 · Cited by 1
Mittelstraß, J. (1995) · J.B. Metzler eBooks · doi:10.1007/978-3-476-98727-3_5 · Cited by 1
Distributed Autoepistemic Logic: Semantics, Complexity, and Applications to Access ControlPreprint
Cramer, M., Hertum, P. V., Bogaerts, B., & Denecker, M. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2306.02774 · Cited by 1
A modal approach to logical consistency
Bezerra, E. V. (2021) · doi:10.47749/t/unicamp.2021.1237293 · Cited by 1
Dönicke, T. (2024) · eDiss (Georg-August-Universität Göttingen) · doi:10.53846/goediss-10494 · Cited by 1
Few-shot Policy (de)composition in Conversational Question AnsweringPreprint
Erwin, K., Axelrod, G., Chang, M., Fokoue, A., Crouse, M., Dan, S., Gao, T., Uceda‐Sosa, R., Makondo, N., Khan, N., et al. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2501.11335 · Cited by 1
Mudholkar, R., Virmani, A., & Mudholkar, S. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5211663 · Cited by 1
Emergent AI Identity via Transfinite Fixed-Point Convergence in Alpay AlgebraPreprint
Alpay, F. (2025) · Preprints.org · doi:10.20944/preprints202506.2400.v1 · Cited by 1
On the Axiomatisation of Non-validity: Sequent-type Rejection Systems and Beyond
Rinke, M. (2023) · reposiTUm (TU Wien) · doi:10.34726/hss.2023.113415 · Cited by 1
Notazioni ordinali e progressioni transfinite di teorie
Martini, A. (2006) · Electronic Theses and Dissertations Repository (University of Pisa) · Cited by 1
Lobina Bona, D. J. (2012) · Rovira & Virgili repository · Cited by 1
Packaging de composants grand gap haute température et haute tension
Roske, L. (2015) · theses.fr (ABES) · doi:10.70675/7df7947az747ez4e15z943bz9ba110c68c01 · Cited by 1
La logique de l'agent rationnel
Kubyshkina, E. (2018) · theses.fr (ABES) · doi:10.70675/f2a5b687z53d8z4b15z84cdz055674f720f8 · Cited by 1
Rice's Theorem under Self-Modification: Elevation Operators and a Normal FormPreprint
Mezquita, J. P. G. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.11326 · Cited by 1
Non-Classical Logics, Non-Classical Sets, and Non-Classical Physics
Pykacz, J. (1999) · Springer eBooks · doi:10.1007/978-94-017-2834-8_4 · Cited by 1
Potvin, B. (2012) · doi:10.71781/16686
Deductive aspects of three-valued logic
Schmitt, P. H. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54594-8_71
On the Significance of Self-Justifying Axiom Systems from the Perspective of Analytic TableauxPreprint
Willard, D. E. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1307.0150
Alban Ponse, A., & van der Zwaag, M. B. (2005) · UvA-DARE (University of Amsterdam)
Reducciones totales y parciales para el análisis de validez y construcción de modelos en M3
Aguilera‐Venegas, G. (2011) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)
Some results on $\mathbb{R}$-computable structuresPreprint
Calvert, W., & Porter, J. E. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0803.3404
PRESUPPOSITION, IMPLICATION, AND NECESSITATION
Stiver, J. L. (1975) · The Southern Journal of Philosophy · doi:10.1111/j.2041-6962.1975.tb01214.x
On a generalized notion of mistake bounds
Jain, S. K., & Sharma, A. (1999) · Conference on Learning Theory · doi:10.1145/307400.307450
An n-Player Semantic Game for an n + 1-Valued Logic
Ju, S., & Wen, X. (2008) · Studia Logica · doi:10.1007/s11225-008-9141-6
Gass, F. S. (1971) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093894157
Self‐learning inductive inference machines
Čerāns, K., & Smith, C. H. (1991) · Computational Intelligence · doi:10.1111/j.1467-8640.1991.tb00392.x
Self-Monitoring Machines and anωωHierarchy of Loops
Changizi, M. A. (1996) · Information and Computation · doi:10.1006/inco.1996.0068
A 4-valued framework encompassing intuitionistic and classical logic
Perkov, T. (2014) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.2014.911533
The Interplay Between Computability and Incomputability Draft 619.tex
Soare, R. I. (2008)
Properties Complementary to Program Self-Reference
Case, J., & Moelius, S. E. (2011) · Fundamenta Informaticae · doi:10.3233/fi-2011-564
A single-type logic for natural language
Liefke, K. (2013) · Journal of Logic and Computation · doi:10.1093/logcom/exs074
Natural deduction for the finite least fixed point logic with an infinitary rule
Arruda, A. M., & Martins, A. T. (2009) · Logic Journal of IGPL · doi:10.1093/jigpal/jzp020
Generalizing Kleene'sO to ordinals ! CK
Budnik, P. (2012)
THE ROLE OF TRUE FINITENESS IN THE
Greenberg, N. (2004)
DOCTEUR DE L'UNIVERSIT ´ E DU LUXEMBOURG EN INFORMATIQUE
Slavkovikj, M. (2012)
Objective mathematics in a nite unbounded universe
Budnik, P. (2014)
On effective undecidability and Post's problemPreprint
Westerbaan, B. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.1030
Ünlü, F. (2009) · Journal of Yaşar University · doi:10.19168/jyu.56401
On the Semantics of Intensional RecursionPreprint
Kavvos, G. A. (2016) · arXiv (Cornell University)
Vague predicates in natural languages
Viney, W. G. (1996) · Libraries and Cultural Resources (University of Calgary) · doi:10.11575/prism/11340
Many-Valued Logic through Its History
Garrido, Á. (2015) · International Joint Conference on Computational Intelligence · doi:10.5220/0005604901700175
Constructive Ordinal Notation Systems
Gass, F. S. (1984) · Mathematics Magazine · doi:10.1080/0025570x.1984.11977093
La négation: Une étude logique
Turner, K. (1994) · Journal of Pragmatics · doi:10.1016/0378-2166(94)90005-1
Some Comments on the Role of the Axiom of Choice in the Development of Abstract Set Theory
Zlot, W. (1959) · Mathematics Magazine · doi:10.1080/19300980.1959.12467602
1998 Spring Meeting of the Association for Symbolic Logic
Martin, D. A. (1998) · Bulletin of Symbolic Logic · doi:10.2307/421024
Inverted Fuzzy Implications in Backward Reasoning Without Yager Implication.
Suraj, Z., & Lasek, A. (2015) · CS&P
An ω -REA set forming a minimal pair with 0~′
Gerdes, P. (2019) · Computability · doi:10.3233/com-180191
Some results on ℝ-computable structures
Calvert, W., & Porter, J. E. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139028592.003
Oracles, Infinitary Computation, and the Physics of the Mind
Cooper, S. B., & Hodges, A. (2016) · Cambridge University Press eBooks · doi:10.1017/cbo9780511863196.019
Robust Network Services with Distributed Code Rewriting
Meyer, T. A., & Tschudin, C. (2013) · IGI Global eBooks · doi:10.4018/978-1-4666-4301-7.ch025
Dispense per il corso di informatica teorica
Vigna, S. (2009)
A Brief Survey of Many-Valued Logics
Pykacz, J. (2015) · SpringerBriefs in physics · doi:10.1007/978-3-319-19384-7_3
Quality-of-service provisioning for dynamic heterogeneous wireless sensor networks
Steine, M. (2013) · TU/e Research Portal · doi:10.6100/ir760026
The Sound and Complete Gentzen Deduction System for the Modalized Łukasiewicz Three-Valued Logic
Cao, C., & Sui, Y. (2016) · International Journal of Fuzzy Logic and Intelligent Systems · doi:10.5391/ijfis.2016.16.3.147
Unifying theories of logics with undefinedness
Bandur, V. (2014) · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)
Analyzing the Communication Behavior of Loop+! Programs
Aachen, W. H. (2013)
On the notion of negation in certain non-classical propositional logics
Nemesszeghy, E. (1980) · Royal Holloway Digital Repository (Royal Holloway University of London)
Verovatnosni računi sekvenata i klasifikacija neklasičnih logika zasnovana na entropiji
Boricic, M. (2016) · Repository of the University of Belgrade Faculty of Organizational Sciences (RFOS)
Models of propositional content
Mack, E. A. (2016) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Warum Vagheit nicht Unwissen ist
Lanius, D. (2010) · Open access LMU (Ludwid Maxmilian's Universitat Munchen) · doi:10.5282/ubm/epub.36277
On the Uniqueness Problem for Notations of Recursive OrdinalsPreprint
Wright, M. T. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.05162
Sobre el anti-realismo de Wittgenstein y su aplicación al programa chomskiano
Mota, S. (2014) · Metatheoria – Revista de Filosofía e Historia de la Ciencia · doi:10.48160/18532330me4.125
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.