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 501–600 of 909
Leibniz und die künstliche Intelligenz: Lingua characteristica und Calculus ratiocinator
Centrone, S. (2021) · Springer Reference Geisteswissenschaften · doi:10.1007/978-3-658-23715-8_52-1 · Cited by 2
Mura, A. (2021) · UnissResearch (Università degli Studi di Sassari) · doi:10.14275/2465-2334/202112.mur · Cited by 2
Many-Valued Dynamic Object-Oriented Inheritance and Approximations
Szałas, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-87334-9_10 · Cited by 2
A nondeterministic Turing machine variant to compute functions
Colombo, J. G. F., & Marchi, J. (2021) · Theoretical Computer Science · doi:10.1016/j.tcs.2021.12.008 · Cited by 2
Silence and Contradiction in the Jaina Saptabhaṅgī
Rahlwes, C. (2023) · Journal of Indian Philosophy · doi:10.1007/s10781-023-09545-5 · Cited by 2
Ordinal Exponentiation in Homotopy Type Theory
de Jong, T., Kraus, N., Forsberg, F. N., & Xu, C. (2025) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics65433.2025.00027 · Cited by 2
Fully evaluated left-sequential logics
Alban Ponse, A., & Staudt, D. J. C. (2025) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.2025.2573569 · Cited by 2
The Woven Mind: Ada Lovelace, Intuitive Computing, and Creative Machines
Lin, P.-Y., & Witkowski, O. (2025) · ALIFE · doi:10.1162/isal.a.837 · Cited by 2
Probabilistic and team PFIN-type learning: General properties
Ambainis, A. (2007) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.06.011 · Cited by 2
Positive and negative Properties. A Logical Interpretation
Kaczmarek, J. (2003) · Bulletin of the Section of Logic · Cited by 2
Logical Opposition and Collective Decisions
Kovač, S. (2012) · Springer eBooks · doi:10.1007/978-3-0348-0379-3_23 · Cited by 2
Semantic games with chance moves revisited: from IF logic to partial logic
Wen, X., & Ju, S. (2011) · Synthese · doi:10.1007/s11229-011-9897-5 · Cited by 2
I-fuzzy equivalence relation and I-transitive approximations
Deng, G., & Jiang, Y. (2012) · International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) · doi:10.1109/fskd.2012.6233876 · Cited by 2
Programs=data=first-class citizens in a computational world
Jones, N. D., & Simonsen, J. G. (2012) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2011.0328 · Cited by 2
An overview of the ordinal calculator
Budnik, P. (2012) · Cited by 2
Program Size Complexity of Correction Grammars in the Ershov Hierarchy
Case, J., & Royer, J. S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-40189-8_25 · Cited by 2
Cataldo, S. D., Tonti, S., Ciglieri, E., Ferrini, F., Macii, E., Ficarra, E., & Salio, C. (2016) · Annals of Computer Science and Information Systems · doi:10.15439/2016f569 · Cited by 2
An Entailment Procedure for Kleene Answer Set Programs
Doherty, P., & Szałas, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-49397-8_3 · Cited by 2
Monoids of non-halting programs with tests
Panicker, G., Krishna, K. V., & Bhaduri, P. (2018) · Algebra Universalis · doi:10.1007/s00012-018-0490-3 · Cited by 2
Effectivity questions for Kleene's recursion theorem
Case, J., Jain, S. K., & Stephan, F. (2018) · Theoretical Computer Science · doi:10.1016/j.tcs.2018.04.036 · Cited by 2
Watanabe, T., Kanno, T., & Furuta, K. (2018) · Journal of Mathematics and System Science · doi:10.17265/2159-5291/2018.02.001 · Cited by 2
On Vidal's trivalent explanations for defective conditional in mathematics
Игоревич, П. Я., & Shangin, V. (2018) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.2018.1534488 · Cited by 2
Klir-Yuan Fuzzy Implication in Fuzzy Relations
Nesimović, S., & Gušić, D. (2019) · International Conference on Control, Artificial Intelligence, Robotics & Optimization (ICCAIRO) · doi:10.1109/iccairo47923.2019.00033 · Cited by 2
De Morgan clones and four-valued logics
Přenosil, A. (2021) · Algebra Universalis · doi:10.1007/s00012-021-00726-5 · Cited by 2
Epistemicism and response-dependence
Hu, I. (2021) · Synthese · doi:10.1007/s11229-021-03196-3 · Cited by 2
The Pre-Analytic History of the Sorites Paradox
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.016 · Cited by 2
Lobina, D. J. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198785156.003.0007 · Cited by 2
Walicki, M., & Dyrkolbotn, S. K. (2022) · The Australasian Journal of Logic · doi:10.26686/ajl.v19i3.6471 · Cited by 2
On Two Types of Concept Lattices in the Theory of Numberings
Bazhenov, N. A., Mustafa, M., & Nurakunov, A. M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20350-3_8 · Cited by 2
Free Quantification in Four-Valued and Fuzzy Bilattice-Valued Logics
Běhounek, L., Daňková, M., & Dvořák, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-46775-2_2 · Cited by 2
A Novel Approach to Fuzzy Implication Through Fuzzy Linear Regression
Gkountakou, F. I., Konguetsof, A., Souliotis, G., & Papadopoulos, B. (2023) · Mathematical Modelling and Engineering Problems · doi:10.18280/mmep.100602 · Cited by 2
Embedding justification theory in approximation fixpoint theory
Marynissen, S., Bogaerts, B., & Denecker, M. (2024) · Artificial Intelligence · doi:10.1016/j.artint.2024.104112 · Cited by 2
Leibniz und die künstliche Intelligenz: Lingua characteristica und Calculus ratiocinator
Centrone, S. (2024) · Springer eBooks · doi:10.1007/978-3-658-19606-6_52 · Cited by 2
Recursion and effectivity in the Decomposability ConjecturePreprint
Gregoriades, V., & Kihara, T. (2014) · arXiv (Cornell University) · Cited by 2
Derivation Schemes in Twin Open Set Logic
Westmoreland, M. D., & Krone, J. (2002) · Springer eBooks · doi:10.1007/978-1-4471-0129-1_8 · Cited by 2
Willard, D. E. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.6330 · Cited by 2
Willard, D. E. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2006.05.047 · Cited by 2
Identifying the most effective reasoning calculi for a knowledge-based system
Mazlack, L. J., & Lee, W. (1993) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.260672 · Cited by 2
A generalization of ACP using Belnap’s logic
Alban Ponse, A., & van der Zwaag, M. B. (2006) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2006.08.006 · Cited by 2
Blanck, R. (2011) · Gothenburg University Publications Electronic Archive (Gothenburg University) · Cited by 2
Non-binary functional synthesis using ACO-based heuristic
Abd‐El‐Barr, M. (2008) · International Journal of Electronics · doi:10.1080/00207210701809325 · Cited by 2
Subsets of ℵ1 constructible from a real
Kechris, A. S. (2006) · Springer eBooks · doi:10.1007/bfb0084973 · Cited by 2
Degrees of computability and randomness
Morphett, A. (2009) · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York) · Cited by 2
Kleene's Two Kinds of RecursionPreprint
Kavvos, G. A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.06220 · Cited by 2
Neutrosophic Frameworks for Situation AnalysisPreprint
Jousselme, A.-L., & Maupin, P. (2016) · viXra · Cited by 2
Lobo, D. (2020) · RODIN (Universidad de Cádiz) · Cited by 2
On equivalence relations and bounded turing degrees
Yu, H. (2018) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/75914 · Cited by 2
Ordinal-recursion And Inductive-definitions.
Cenzer, D. (1972) · Deep Blue (University of Michigan) · doi:10.7302/18053 · Cited by 2
Bisequent Calculi for Neutral Free Logic with Definite DescriptionsPreprint
Indrzejczak, A., & Игоревич, П. Я. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2412.01712 · Cited by 2
Universal PredictionPreprint
Sterkenburg, T. F. (2018) · PhilSci-Archive (University of Pittsburgh) · Cited by 2
Intent-based Network Management
Dzeparoska, K. (2024) · TSpace (University of Toronto) · Cited by 2
The structure of orders in the pushdown hierarchy
Braud, L. (2010) · theses.fr (ABES) · doi:10.70675/0df3c23cz2df4z413az9933z0a3bb0ebda9a · Cited by 2
Constructing Semantically Sound Object-Logics for UML/OCL Based Domain-Specific Languages
Tuong, F. (2016) · theses.fr (ABES) · doi:10.70675/d2678bfbz03e4z436czbe88ze142a4922d6e · Cited by 2
Sοficity οf multidimensiοnal subshifts
Callard, A. (2025) · theses.fr (ABES) · doi:10.70675/2f62f620z4bccz465dzb2c1z6a3cc5634f2a · Cited by 2
On the mechanisation of the logic of partial functions
Lovert, M. J. (2013) · Cited by 2
Infinitary Queries in Spatial DatabasesPreprint
Calvert, W., & Porter, J. E. (2008) · arXiv (Cornell University) · Cited by 2
The Sorites Paradox in Practical Philosophy
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.013 · Cited by 1
Learning with ordinal-bounded memory from positive data
Carlucci, L., Jain, S. K., & Stephan, F. (2012) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2012.03.002 · Cited by 1
Essert, M., Kuzmanović, I., Vazler, I., & Žilić, T. (2017) · Logic Journal of IGPL · doi:10.1093/jigpal/jzx025 · Cited by 1
On the structure of C-algebras through atomicity and if-then-else
Panicker, G., Krishna, K. V., & Bhaduri, P. (2020) · Algebra Universalis · doi:10.1007/s00012-020-0648-7 · Cited by 1
Bund, J., Lenzen, C., & Medina, M. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3533096 · Cited by 1
A New Heuristic Tool for Designing Multiple-Valued Logic Systems
Savran, I. (2023) · Journal of Circuits Systems and Computers · doi:10.1142/s0218126623502614 · Cited by 1
A Query Language for OPC UA Event Filters
Duewel, F., Ebner, A., & Pfrommer, J. (2024) · IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) · doi:10.1109/etfa61755.2024.10710686 · Cited by 1
Stamatiou, Y. C., Liagkou, V., Spirakis, P. G., & Nastou, P. (2025) · Cryptography · doi:10.3390/cryptography9010016 · Cited by 1
Standing Up for Philosophy: Armchairs, Experiments, and the Case for Methodological Reform
Weinberg, J. M., & Alexander, J. (2025) · doi:10.1093/9780191947704.001.0001 · Cited by 1
The Limits of Armchair Philosophy
Weinberg, J. M., & Alexander, J. (2025) · Oxford University Press eBooks · doi:10.1093/9780191947704.003.0005 · Cited by 1
Filter-induced entailment relations in paraconsistent Gödel logics
Frittella, S., & Kozhemiachenko, D. (2025) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2025.109563 · Cited by 1
LÓGICA Y PARADOJAS: UN ESTUDIO FILOSÓFICO. De lo abstracto a lo concreto - Volumen II
Ramírez, R. F. M. (2025) · doi:10.64639/r17nk323 · Cited by 1
From episodes to populations: evolutionary explanation requires a constructive epistemology
Adler, D. (2026) · Theory in Biosciences · doi:10.1007/s12064-026-00485-8 · Cited by 1
Finite Convergence of the Modal $$\mu $$-Calculus on Almost-Periodic Words
Lehr, F., & Bruse, F. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-41167-9_9 · Cited by 1
Extended recursion-based formalization of virus mutation
Beaucamps, P. (2008) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-008-0090-4 · Cited by 1
Logika eta logikak. Begirada bat logika ez-klasikoei
Arrazola, X. (2009) · Gogoa · doi:10.1387/gogoa.3538 · Cited by 1
Nouvelle solution pragmatiste du paradoxe du Menteur
Séguy-Duclot, A. (2014) · Dialogue · doi:10.1017/s0012217314001103 · Cited by 1
Control hipotalámico de las interacciones neuroendocrinas
Lizarbe, B., & Cerdán, S. (2013) · DIGITAL.CSIC (Spanish National Research Council (CSIC)) · doi:10.13039/501100003329 · Cited by 1
Quintana, I. O. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-54069-5_14 · Cited by 1
Rough Granular Computing in Modal Settings: Generalised Approximation Spaces
Wolski, M., & Gomolińska, A. (2016) · Fundamenta Informaticae · doi:10.3233/fi-2016-1428 · Cited by 1
On the impact of forgetting on learing machines.
Freivalds, R., Kinber, E. B., & Smith, C. H. (1993) · Bulletin of the European Association for Theoretical Computer Science · Cited by 1
On the Computable Theory of Bounded Analytic Functions
McNicholl, T. H. (2012) · Fields Institute communications · doi:10.1007/978-1-4614-5341-3_13 · Cited by 1
UPSILON: Universal Programming System with Incomplete Lazy Object Notation
Postow, B., Regan, K. W., & Smith, C. H. (2002) · Fundamenta Informaticae · doi:10.3233/fun-2002-503-406 · Cited by 1
Sobre el concepto de recursión y sus usos
Mota, S. (2015) · Praxis Filosófica Nueva Serie · doi:10.25100/pfilosofica.v0i40.3016 · Cited by 1
A Computational Approach to the Ordinal Numbers
Budnik, P. (2011) · Cited by 1
Logic programming: From underspecification to undefinedness
Naish, L., Søndergaard, H., & Horsfall, B. (2012) · Computing: The Australasian Theory Symposium · Cited by 1
Proceedings of the IJCAI-2011 Workshop on Social Choice and Artificial Intelligence
Elkind, E., & Endriss, U. (2011) · Cited by 1
SEMANTICAL MUTATION, ALGORITHMS AND PROGRAMS
Porto, A. (2015) · Dissertatio · doi:10.15210/dissertatio.v0i0.8565 · Cited by 1
Gericke, J. (2016) · Verbum et Ecclesia · doi:10.4102/ve.v37i1.1528 · Cited by 1
Implementing a Relevance Tracker Module
Jansen, J., Devriendt, J., Bogaerts, B., Janssens, G., & Denecker, M. (2016) · Lirias · doi:10.48550/arxiv.1608.05609 · Cited by 1
From Multi-valued Logics to Fuzzy Logic
Seising, R. (2016) · Studies in fuzziness and soft computing · doi:10.1007/978-3-319-48317-7_1 · Cited by 1
The life and mathematics of Norberto Cuesta (1907-1989)
Castelao, J. M. P. (2014) · Revista de la Academia Canaria de Ciencias: = Folia Canariensis Academiae Scientiarum · Cited by 1
Неклассические модификации многозначных матриц классической логики. Часть II
Девяткин, Л. Ю. (2017) · Logical Investigations · doi:10.21146/2074-1472-2017-23-1-11-47 · Cited by 1
The Singularity Business: Toward a Realistic, Fine-Grained Economics for an AI-Infused World
Bringsjord, S., & Bringsjord, A. (2017) · Philosophical studies series · doi:10.1007/978-3-319-61043-6_6 · Cited by 1
by-st. Vokzalny, 6., & Kalko, R. (2017) · International Journal of Advanced Research · doi:10.21474/ijar01/6010 · Cited by 1
Watanabe, T., Kanno, T., & Furuta, K. (2018) · International Journal of Modeling and Optimization · doi:10.7763/ijmo.2018.v8.623 · Cited by 1
Normality Operators and Classical Collapse
Ciuni, R., & Carrara, M. (2018) · PhilPapers (PhilPapers Foundation) · Cited by 1
Inference in the FO(C) Modelling Language
Bogaerts, B., Vennekens, J., Denecker, M., & den Bussche, J. V. (2014) · Lirias · Cited by 1
Formes, objets et négation selon Granger: Une interprétation constructive1
Schang, F. (2020) · Philosophiques · doi:10.7202/1070248ar · Cited by 1
A three-valued doxastic logic based on Kleene’s and Bochvar’s ideas
Wesserling, J. (2019) · Studia Philosophiae Christianae · doi:10.21697/spch.2019.55.4.04 · Cited by 1
Willard, D. E. (2020) · Journal of Logic and Computation · doi:10.1093/logcom/exaa083 · Cited by 1
The Catuṣkoṭi, the Saptabhaṇgī, and “Non-Classical” Logic
Priest, G. (2021) · Springer eBooks · doi:10.1007/978-81-322-1812-8_50-1 · Cited by 1
Effective Enumeration of Infinitely Many Programs that Evade Formal Malware Analysis
Liagkou, V., Nastou, P. E., Spirakis, P. G., & Stamatiou, Y. C. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-78086-9_18 · Cited by 1
Intuitionism and the Sorites Paradox
Wright, C. (2021) · Oxford University Press eBooks · doi:10.1093/oso/9780199277339.003.0015 · Cited by 1
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.