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 301–400 of 909
Exact Truthmaker Semantics for Modal Logics
Kim, D. (2024) · Journal of Philosophical Logic · doi:10.1007/s10992-024-09752-9 · Cited by 7
Relational Approaches to Knowledge Representation and Learning
Berichte, I. (2009) · Cited by 7
NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM
Hämeen-Anttila, M. (2019) · Bulletin of Symbolic Logic · doi:10.1017/bsl.2018.91 · Cited by 7
The Sorites Paradox in Psychology
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.015 · Cited by 7
An Introduction to the Sorites Paradox Sergi Oms and Elia Zardini
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.001 · Cited by 7
A brief history of determinacy
Larson, P. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.002 · Cited by 7
A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus
Indrzejczak, A., & Игоревич, П. Я. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38499-8_19 · Cited by 7
Things that can be made into themselves
Stephan, F., & Teutsch, J. (2014) · Information and Computation · doi:10.1016/j.ic.2014.02.002 · Cited by 7
LogAB: A first-order, non-paradoxical, algebraic logic of belief
Ismail, H. O. (2012) · Logic Journal of IGPL · doi:10.1093/jigpal/jzs007 · Cited by 7
Analysis of Spatio-temporal Properties of Stochastic Systems Using TSTL
Vissat, L. L., Loreti, M., Nenzi, L., Hillston, J. E., & Marion, G. (2019) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/3326168 · Cited by 7
Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
de Brecht, M., & Yamamoto, A. (2006) · Lecture notes in computer science · doi:10.1007/11894841_13 · Cited by 7
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
Greenberg, N. (2005) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1122038994 · Cited by 7
Carlucci, L., Case, J., & Jain, S. K. (2009) · Journal of Symbolic Logic · doi:10.2178/jsl/1243948324 · Cited by 7
Robustness to Code and Data Deletion in Autocatalytic Quines
Meyer, T. A., Schreckling, D., Tschudin, C., & Yamamoto, L. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92273-5_2 · Cited by 7
Probabilistic and team PFIN-type learning: general properties
Ambainis, A. (1996) · Conference on Learning Theory · doi:10.1145/238061.238087 · Cited by 7
A note on arbitrarily complex recursive functions.
Smith, C. H. (1988) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093637869 · Cited by 7
On the intrinsic complexity of learning recursive functions
Kinber, E. B., Papazian, C., Smith, C. H., & Wiehagen, R. (1999) · Conference on Learning Theory · doi:10.1145/307400.307465 · Cited by 7
Recursive Functions Over Well Ordered Partial Orderings
Rogers, H. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0111685-8 · Cited by 7
Process algebra and conditional composition
Bergstra, J. A., & Alban Ponse, A. (2001) · Information Processing Letters · doi:10.1016/s0020-0190(01)00216-2 · Cited by 7
Álvarez, L. G. (2019) · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York) · Cited by 7
Non-Deterministic Matrices in Action: Expansions, Refinements, and Rexpansions
Avron, A., & Zohar, Y. (2017) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2017.16 · Cited by 6
AD and the uniqueness of the supercompact measures on ℘ꞷ1 (λ)
Woodin, W. H. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.008 · Cited by 6
Zardini, E. (2022) · Journal of Philosophical Logic · doi:10.1007/s10992-022-09682-4 · Cited by 6
To the Definition of Algorithms
Uspenski, V. A. (1993) · Mathematics and its applications. Soviet series · doi:10.1007/978-94-017-2973-4_6 · Cited by 6
Fast Three-Valued Abstract Bit-Vector Arithmetic
Onderka, J., & Ratschan, S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-94583-1_12 · Cited by 6
The Sorites Paradox in Philosophy of Logic
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.011 · Cited by 6
Moschovakis, Y. N. (2016) · Outstanding contributions to logic · doi:10.1007/978-3-319-41842-1_5 · Cited by 6
Inverted Fuzzy Implications in Backward Reasoning
Suraj, Z., & Lasek, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-19941-2_34 · Cited by 6
On elementary theories of ordinal notation systems based on reflection principles
Pakhomov, F. (2015) · Proceedings of the Steklov Institute of Mathematics · doi:10.1134/s0081543815040124 · Cited by 6
A Swiss Pocket Knife for Computability
Jones, N. D. (2013) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.129.1 · Cited by 6
Nondeterministic Structure of Computation
Fu, Y. (2013) · Cited by 6
Many-valued logic in manufacturing
Eklund, P., & Löfstrand, M. (2016) · Annals of Computer Science and Information Systems · doi:10.15439/2016f73 · Cited by 6
On the complexity of hazard-free circuits
Ikenmeyer, C., Komarath, B., Lenzen, C., Lysikov, V., Mokhov, A., & Sreenivasaiah, K. (2018) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3188745.3188912 · Cited by 6
Pecularities of Some Three- and Four-Valued Second Order Logics
Hazen, A., & Pelletier, F. J. (2018) · Logica Universalis · doi:10.1007/s11787-018-0214-7 · Cited by 6
Proofs you can believe in: proving equivalences between Prolog semantics in Coq
Kriener, J. E., King, A., & Blazy, S. (2013) · International Symposium on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/2505879.2505886 · Cited by 6
Russell and His Sources for Non-Classical Logics
Anellis, I. H. (2009) · Logica Universalis · doi:10.1007/s11787-009-0006-1 · Cited by 6
Functional Completeness in CPL via Correspondence Analysis
Leszczyńska-Jasion, D., Игоревич, П. Я., Shangin, V., & Jukiewicz, M. (2019) · Bulletin of the Section of Logic · doi:10.18778/0138-0680.48.1.04 · Cited by 6
Computable Linear Orders and Limitwise Monotonic Functions
Frolov, A. N., & Zubkov, M. V. (2021) · Journal of Mathematical Sciences · doi:10.1007/s10958-021-05421-3 · Cited by 6
Physics is Organized Around Transformations Connecting Contextures in a Polycontextural World
Falk, J., Eichler, E., Windt, K., & Hütt, M. ‐. (2021) · Foundations of Science · doi:10.1007/s10699-021-09814-0 · Cited by 6
Memory limited inductive inference machines
Freivalds, R., & Smith, C. H. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55706-7_2 · Cited by 6
General inductive inference types based on linearly-ordered sets
Ambainis, A., Freivalds, R., & Smith, C. H. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60922-9_21 · Cited by 6
Properties Complementary to Program Self-reference
Case, J., & Moelius, S. E. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74456-6_24 · Cited by 6
Complexity Classes of Recursive Functions
Moll, R. N. (1973) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 6
Turing's ‘Oracle’: From Absolute to Relative Computability and Back
Feferman, S. (2016) · Cambridge University Press eBooks · doi:10.1017/cbo9780511863196.020 · Cited by 6
Computability and Enumerability
Soare, R. I. (1997) · Springer eBooks · doi:10.1007/978-94-017-0487-8_12 · Cited by 6
Non-uniqueness at ω2 in Kleene'sO
Crossley, J. N., & Schütte, K. (1966) · Archive for Mathematical Logic · doi:10.1007/bf01973029 · Cited by 6
Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem
Willard, D. E. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45616-3_20 · Cited by 6
Пинус, А. Г. (1975) · Siberian Mathematical Journal · doi:10.1007/bf00967393 · Cited by 6
An axiomatization of Herzberger's $2$-dimensional presuppositional semantics.
Martin, J. N. T. (1977) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093888010 · Cited by 6
The noneffectivity of Arslanov’s completeness criterion and related theorems
Terwijn, S. A. (2020) · Archive for Mathematical Logic · doi:10.1007/s00153-020-00712-z · Cited by 6
Deriving fuzzy subsethood measures from violations of the implication between elements
Botana, F. (1998) · Lecture notes in computer science · doi:10.1007/3-540-64582-9_753 · Cited by 6
Process Algebra with Five-Valued Conditions
Bergstra, J. A., & Alban Ponse, A. (n.d.) · Cited by 6
Elementary formal systems, intrinsic complexity, and procrastination
Jain, S. K., & Sharma, A. (1996) · Conference on Learning Theory · doi:10.1145/238061.238093 · Cited by 6
Malinowski, G. (2017) · Wiley eBooks · doi:10.1002/9781405164801.ch14 · Cited by 5
Mathematical induction in ramified type theory
Royse, J. R. (1969) · Mathematical logic quarterly · doi:10.1002/malq.19690150103 · Cited by 5
A Three-Valued Semantics for Typed Logic Programming
Barbosa, J., Florido, M., & Costa, V. S. (2019) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.306.10 · Cited by 5
Fixpoints and relative precompleteness
Golov, A., & Terwijn, S. A. (2022) · Computability · doi:10.3233/com-210344 · Cited by 5
A General Semantics for Logics of Affirmation and Negation
Schang, F. (2021) · PhilPapers (PhilPapers Foundation) · Cited by 5
On trivalent logics, probabilistic weak deduction theorems, and a general import-export principle
Gilio, A., Over, D. E., Pfeifer, N., & Sanfilippo, G. (2024) · Artificial Intelligence · doi:10.1016/j.artint.2024.104229 · Cited by 5
Vissat, L. L., Loreti, M., Nenzi, L., Hillston, J. E., & Marion, G. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-66335-7_22 · Cited by 5
Axiomatization of if-then-else over possibly non-halting programs and tests
Panicker, G., Krishna, K. V., & Bhaduri, P. (2017) · International Journal of Algebra and Computation · doi:10.1142/s0218196717500138 · Cited by 5
The tail-recursive fragment of timed recursive CTL
Bruse, F., & Lange, M. (2023) · Information and Computation · doi:10.1016/j.ic.2023.105084 · Cited by 5
Non-deterministic Multi-valued Logics--A Tutorial
Avron, A., & Zamansky, A. (2010) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2010.18 · Cited by 5
What Difference Does it Make: Three Truth-Values or Two Plus Gaps?
Kijania-Placek, K. (2002) · Erkenntnis · doi:10.1023/a:1014772016276 · Cited by 5
The Hierarchy Based on the Jump Operator*
(1980) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71263-1 · Cited by 5
Why Post Did [Not] Have Turing’s Thesis
Sieg, W., Szabó, M. Z., & McLaughlin, D. (2016) · Outstanding contributions to logic · doi:10.1007/978-3-319-41842-1_7 · Cited by 5
Rough set reasoning using answer set programs
Doherty, P., & Szałas, A. (2020) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2020.12.010 · Cited by 5
The extender algebra and Σ21-absoluteness
Farah, I. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.009 · Cited by 5
Dellacherie, C. (1981) · Lecture notes in mathematics · doi:10.1007/bfb0090234 · Cited by 5
All Brutes are Subhuman: Aristotle and Ockham on Private Negation
Martin, J. N. T. (2003) · Synthese · doi:10.1023/a:1022934709521 · Cited by 5
Anytime Approximations of Classical Logic from Above
Finger, M., & Wassermann, R. (2006) · Journal of Logic and Computation · doi:10.1093/logcom/exl018 · Cited by 5
A calculus for four-valued sequential logic
Bergstra, J. A., & van de Pol, J. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2011.02.035 · Cited by 5
The tangibility reflection principle for self-verifying axiom systems
Willard, D. E. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63385-5_53 · Cited by 5
Structural Operational Semantics with First-Order Logic
van Weerdenburg, M., & Reniers, M. A. (2009) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2009.07.075 · Cited by 5
Carlucci, L., Case, J., & Jain, S. K. (2007) · Springer eBooks · doi:10.1007/978-3-540-72927-3_16 · Cited by 5
Automorphisms and linearisations of computable orderings
Lee, K. I. (2011) · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York) · Cited by 5
On learning multiple concepts in parallel
Kinber, E. B., Smith, C. H., Velauthapillai, M., & Wiehagen, R. (1993) · Conference on Learning Theory · doi:10.1145/168304.168328 · Cited by 5
Foundations of fuzzy answer set programming
Janssen, J. (2011) · Ghent University Academic Bibliography (Ghent University) · Cited by 5
Learning Programs with an Easy to Calculate Set of Errors1
Gasarch, W. I., Sitaraman, R. K., Smith, C. H., & Velauthapillai, M. (1992) · Fundamenta Informaticae · doi:10.3233/fi-1992-163-409 · Cited by 5
Willard, D. E. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.08071 · Cited by 5
Intensionality, Intensional Recursion, and the Gödel-Löb axiomPreprint
Kavvos, G. A. (2017) · Explore Bristol Research · doi:10.48550/arxiv.1703.01288 · Cited by 5
A Swiss Pocket Knife for ComputabilityPreprint
Banerjee, A., Danvy, O., Doh, K. G., (eds, J. H., & Jones, N. D. (n.d.) · Cited by 5
Reasoning Around Paradox with Grounded DeductionPreprint
Ford, B. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2409.08243 · Cited by 5
Well-Ordering Principles across Reverse Mathematics
Uftring, P. (2025) · Online Publication Service of Würzburg University (Würzburg University) · doi:10.25972/opus-40271 · Cited by 5
Berger, T. (2012) · Qucosa (Saxon State and University Library Dresden) · Cited by 5
Chain-based Sugeno-like operators: A new take on the Sugeno integral as a scientometric tool
Borzová, J., Hutník, O., & Kleinová, M. (2025) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2025.109578 · Cited by 4
New perspectives on semiring applications to dynamic programming
Baril, A., Couceiro, M., & Lagerkvist, V. (2025) · Discrete Applied Mathematics · doi:10.1016/j.dam.2025.12.035 · Cited by 4
The Problem of Universals Then and Now
Stegmüller, W. (1977) · Springer eBooks · doi:10.1007/978-94-010-1129-7_1 · Cited by 4
Mota, S. (2017) · Journal of Applied Logic · doi:10.1016/j.jal.2017.03.003 · Cited by 4
Supervaluationism, Subvaluationism and the Sorites Paradox
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.003 · Cited by 4
Large Cardinals, Determinacy and Other Topics: The Cabal Seminar, Volume IV
Kechris, A. S., Löwe, B., & Steel, J. R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534 · Cited by 4
The independence of DC from AD
Solovay, R. M. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.004 · Cited by 4
Neutral Free Logic: Motivation, Proof Theory and Models
Pavlović, E., & Gratzl, N. (2022) · Journal of Philosophical Logic · doi:10.1007/s10992-022-09679-z · Cited by 4
On Concept Lattices for Numberings
Bazhenov, N. A., Mustafa, M., & Nurakunov, A. M. (2024) · Tsinghua Science & Technology · doi:10.26599/tst.2023.9010102 · Cited by 4
Hyde, D. (2007) · Handbook of the history of logic · doi:10.1016/s1874-5857(07)80008-2 · Cited by 4
Recursive Functions: An Archeological Look
Odifreddi, P. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0717-0_3 · Cited by 4
Indefinite Extensibility in Natural Language
Luna, L. (2013) · The Monist · doi:10.5840/monist201396211 · Cited by 4
Boričić, M. (2016) · Yugoslav journal of operations research · doi:10.2298/yjor151025011b · Cited by 4
Semantics for Active Integrity Constraints Using Approximation Fixpoint Theory
Bogaerts, B., & Cruz-Filipe, L. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/120 · Cited by 4
Intensional Kleene and Rice theorems for abstract program semantics
Baldan, P., Ranzato, F., & Zhang, L. (2022) · Information and Computation · doi:10.1016/j.ic.2022.104953 · Cited by 4
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.