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
Recursively enumerable sets of positive integers and their decision problems
Post, E. L. (1944) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1944-08111-1 · Cited by 872
Classes of recursively enumerable sets and their decision problems
Rice, H. G. (1953) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1953-0053041-6 · Cited by 869
“That is, A includes XI*-o L(a,)- (In fact, it can be shown(4) that the finite sets of A can be recursively enumerated, so that A includes the EIX^ class generated by its finite sets.”
BackgroundOn the interpretation of intuitionistic number theory
Kleene, S. C. (1945) · Journal of Symbolic Logic · doi:10.2307/2269016 · Cited by 538
Self-citationNelson, D. B. (1949) · Journal of Symbolic Logic · doi:10.2307/2268973 · Cited by 507
Fuzzy power sets and fuzzy implication operators
Bandler, W., & Kohout, L. (1980) · Fuzzy Sets and Systems · doi:10.1016/0165-0114(80)90060-3 · Cited by 474
Kunen, K. (1987) · The Journal of Logic Programming · doi:10.1016/0743-1066(87)90007-0 · Cited by 439
Recursive Functionals and Quantifiers of Finite Types I
Kleene, S. C. (1959) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1959-0102480-9 · Cited by 372
Self-citationRecursive predicates and quantifiers
Kleene, S. C. (1943) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1943-0007371-8 · Cited by 363
Self-citationBeaver, D. I. (1997) · Elsevier eBooks · doi:10.1016/b978-044481714-3/50022-9 · Cited by 287
Soare, R. I. (1996) · Bulletin of Symbolic Logic · doi:10.2307/420992 · Cited by 268
Effective procedures in field theory
Fröhlich, A., & Shepherdson, J. C. (1956) · Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences · doi:10.1098/rsta.1956.0003 · Cited by 249
Fitch, W. T. (2014) · Physics of Life Reviews · doi:10.1016/j.plrev.2014.04.005 · Cited by 223
Origins of Recursive Function Theory
Kleene, S. C. (1981) · IEEE Annals of the History of Computing · doi:10.1109/mahc.1981.10004 · Cited by 211
Self-citationSpector, C. (1955) · Journal of Symbolic Logic · doi:10.2307/2266902 · Cited by 208
Urquhart, A. (2001) · Springer eBooks · doi:10.1007/978-94-017-0452-6_4 · Cited by 176
An Introduction to Many-Valued and Fuzzy Logic: Semantics, Algebras, and Derivation Systems
Bergmann, M. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511801129 · Cited by 174
Arithmetical Predicates and Function Quantifiers
Kleene, S. C. (1955) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1955-0070594-4 · Cited by 171
Self-citationHierarchies of number-theoretic predicates
Kleene, S. C. (1955) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1955-09896-3 · Cited by 170
Self-citationUrquhart, A. (1986) · Springer eBooks · doi:10.1007/978-94-009-5203-4_2 · Cited by 170
Non-Deterministic Semantics for Logical Systems
Avron, A., & Zamansky, A. (2010) · Springer eBooks · doi:10.1007/978-94-007-0479-4_4 · Cited by 166
Multiple Valued Logic: Concepts and Representations
Miller, D. M., & Thornton, M. A. (2007) · Synthesis lectures on digital circuits and systems · doi:10.2200/s00065ed1v01y200709dcs012 · Cited by 155
Computer viruses: from theory to applications
Filiol, É. (2005) · Springer eBooks · doi:10.1007/2-287-28099-5 · Cited by 153
Why Gödel didn't have church's thesis
Davis, M. D. (1982) · Information and Control · doi:10.1016/s0019-9958(82)91226-8 · Cited by 148
The Power of Pluralism for Automatic Program Synthesis
Smith, C. H. (1982) · Journal of the ACM · doi:10.1145/322344.322356 · Cited by 139
The Confluence of Ideas in 1936
Gandy, R. O. (1990) · Oxford University Press eBooks · doi:10.1007/978-3-7091-6597-3_3 · Cited by 125
Alfred Tarski's work in model theory
Vaught, R. L. (1986) · Journal of Symbolic Logic · doi:10.2307/2273900 · Cited by 122
Propositional Calculus and Realizability
Rose, G. F. (1953) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1953-0055952-4 · Cited by 118
Kleene, S. C., Barwise, J., Keisler, H. J., & Kunen, K. (1980) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)x7060-0 · Cited by 118
Self-citationWu, Y., & Shen, T. (2015) · Systems & Control Letters · doi:10.1016/j.sysconle.2015.04.007 · Cited by 117
Malinowski, G. (1994) · Cited by 117
Turing oracle machines, online computing, and three displacements in computability theory
Soare, R. I. (2009) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2009.01.008 · Cited by 111
ALGORITHMS: A QUEST FOR ABSOLUTE DEFINITIONS
Blass, A. R., & Gurevich, Y. G. (2004) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812562494_0051 · Cited by 107
Design of Ternary Logic Combinational Circuits Based on Quantum Dot Gate FETs
Karmakar, S., Chandy, J. A., & Jain, F. (2012) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2012.2198248 · Cited by 105
The independence of DC from AD
Solovay, R. M. (1978) · Lecture notes in mathematics · doi:10.1007/bfb0069299 · Cited by 104
On the Role of Procrastination in Machine Learning
Freivalds, R., & Smith, C. H. (1993) · Information and Computation · doi:10.1006/inco.1993.1068 · Cited by 101
Concept lattices defined from implication operators
Burusco, A., & Fuentes-González, R. (2000) · Fuzzy Sets and Systems · doi:10.1016/s0165-0114(98)00182-1 · Cited by 98
Many-Valued Logic and its Philosophy
Malinowski, G. (2007) · Handbook of the history of logic · doi:10.1016/s1874-5857(07)80004-5 · Cited by 96
HGABAC: Towards a Formal Model of Hierarchical Attribute-Based Access Control
Servos, D., & Osborn, S. L. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-17040-4_12 · Cited by 93
Enderton, H. B. (1977) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71114-5 · Cited by 91
Alan Turing and the Mathematical Objection
Piccinini, G. (2003) · Minds and Machines · doi:10.1023/a:1021348629167 · Cited by 85
Recursive Functionals and Quantifiers of Finite Types II
Kleene, S. C. (1963) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1963-0153557-4 · Cited by 82
Self-citationComputations and Computers in the Sciences of Mind and Brain
Piccinini, G. (2003) · D-Scholarship@Pitt (University of Pittsburgh) · Cited by 77
Recursive Functions and Intuitionistic Number Theory
Nelson, D. B. (1947) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1947-0025420-1 · Cited by 76
Guo, Z. Y., Wan, Z., Zhang, Q., Zhao, X., Zhang, Q., Kaplan, L., Jøsang, A., Jeong, D. H., Chen, F., & Cho, J.-H. (2023) · Information Fusion · doi:10.1016/j.inffus.2023.101987 · Cited by 75
The Nature of Physical Computation
Shagrir, O. (2022) · doi:10.1093/oso/9780197552384.001.0001 · Cited by 70
New Foundations for Imperative Logic I: Logical Connectives, Consistency, and Quantifiers*
Vranas, P. B. M. (2008) · Noûs · doi:10.1111/j.1468-0068.2008.00684.x · Cited by 69
Égré, P., Ripley, D., & Verheyen, S. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064 · Cited by 68
Automated Deduction for Many-Valued Logics
Matthias Baaz, A., Fermüller, C. G., & Salzer, G. (2001) · Elsevier eBooks · doi:10.1016/b978-044450813-3/50022-9 · Cited by 68
The theory of recursive functions, approaching its centennial
Kleene, S. C. (1981) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1981-14920-x · Cited by 68
Self-citationA propositional logic with 4 values: true, false, divergent and meaningless
Bergstra, J. A., Bethke, I., & Rodenburg, P. H. (1995) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.1995.10510855 · Cited by 65
Realizability: A retrospective survey
Kleene, S. C. (1973) · Lecture notes in mathematics · doi:10.1007/bfb0066772 · Cited by 62
Self-citationForeword: Three-valued logics and their applications
Cobreros, P., Égré, P., Ripley, D., & van Rooij, R. (2014) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.2014.909631 · Cited by 60
A functional approach to syntax and typing
van den Beuken, F. A. M. (1997) · Radboud Repository (Radboud University) · Cited by 60
Models and logics for process algebra
van der Zwaag, M. B. (2002) · UvA-DARE (University of Amsterdam) · Cited by 59
Kleene's Amazing Second Recursion Theorem
Moschovakis, Y. N. (2010) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1286889124 · Cited by 58
Steel, J. R. (1978) · Lecture notes in mathematics · doi:10.1007/bfb0069301 · Cited by 58
Self-verifying axiom systems, the incompleteness theorem and related reflection principles
Willard, D. E. (2001) · Journal of Symbolic Logic · doi:10.2307/2695030 · Cited by 57
Vagueness, presupposition and truth-value judgements
Zehr, J. (2014) · theses.fr (ABES) · doi:10.70675/1eb11e55z77cbz4280zb3dcze6b615a03e3e · Cited by 57
The formalization of mathematics
Wang, H. (1954) · Journal of Symbolic Logic · doi:10.2307/2267732 · Cited by 56
Caleiro, C., Marcos, J., & Volpe, M. (2015) · Theoretical Computer Science · doi:10.1016/j.tcs.2015.07.016 · Cited by 53
Beaucamps, P., & Filiol, É. (2006) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-006-0029-6 · Cited by 53
Inversive meadows and divisive meadows
Bergstra, J. A., & Middelburg, C. A. (2011) · Journal of Applied Logic · doi:10.1016/j.jal.2011.03.001 · Cited by 52
The independence of control structures in abstract programming systems
Riccardi, G. A. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90024-6 · Cited by 52
Functional Decision Theory: A New Theory of Instrumental RationalityPreprint
Yudkowsky, E., & Soares, N. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.05060 · Cited by 51
Three-way decision with incomplete information based on similarity and satisfiability
Luo, J., Hu, M., & Qin, K. (2020) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2020.02.005 · Cited by 48
Truth and The Ambiguity of Negation
Marques, T. (2010) · PhilPapers (PhilPapers Foundation) · Cited by 47
The History and Concept of Computability
Soare, R. I. (1999) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(99)80017-2 · Cited by 47
Intent Assurance using LLMs guided by Intent Drift
Dzeparoska, K., Tizghadam, A., & Leon‐Garcia, A. (2024) · IEEE/IFIP Network Operations and Management Symposium (NOMS) · doi:10.1109/noms59830.2024.10575429 · Cited by 46
Cattaneo, G., & Ciucci, D. (2006) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2006.06.003 · Cited by 46
Zur Theorie der konstruktiven Wohlordnungen
Markwald, W. (1954) · Mathematische Annalen · doi:10.1007/bf01361115 · Cited by 46
ConfigFix: Interactive Configuration Conflict Resolution for the Linux Kernel
Franz, P., Berger, T., Fayaz, I., Nadi, S., & Groshev, E. (2021) · IEEE/ACM International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP) · doi:10.1109/icse-seip52600.2021.00018 · Cited by 45
On Interpreting Chaitin's Incompleteness Theorem
Raatikainen, P. (1998) · Journal of Philosophical Logic · doi:10.1023/a:1004305315546 · Cited by 45
Reflections on Church's thesis.
Kleene, S. C. (1987) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093637645 · Cited by 45
Self-citationA three-valued logic for software specification and validation: Tertium tamen datur
Konikowska, B., Tarlecki, A., & Blikle, A. (1988) · Lecture notes in computer science · doi:10.1007/3-540-50214-9_19 · Cited by 44
Feferman, S. (1988) · Springer eBooks · Cited by 43
Panti, G. (1998) · Springer eBooks · doi:10.1007/978-94-017-1735-9_2 · Cited by 42
Fifty years of self-reference in arithmetic.
Smoryński, C. (1981) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093883515 · Cited by 42
Many-Valued Logic And Fuzzy Set Theory
Gottwald, S. (1999) · The Handbooks of fuzzy sets series · doi:10.1007/978-1-4615-5079-2_2 · Cited by 42
Some consistency results in ZFC using AD
Woodin, W. H. (2006) · Springer eBooks · doi:10.1007/bfb0071701 · Cited by 41
On the Computability of Conditional Probability
Ackerman, N., Freer, C. E., & Roy, D. M. (2019) · Journal of the ACM · doi:10.1145/3321699 · Cited by 40
Foreman, M. D. (2006) · Springer eBooks · doi:10.1007/bfb0071691 · Cited by 40
Bochvar's Three-Valued Logic and Literal Paralogics: Their Lattice and Functional Equivalence
Karpenko, A. S., & Томова, Н. Е. (2016) · Logic and Logical Philosophy · doi:10.12775/llp.2016.029 · Cited by 39
On dynamically non-trivial three-valued logics: oscillatory and bifurcatory species
Adamatzky, A. (2003) · Chaos Solitons & Fractals · doi:10.1016/s0960-0779(03)00063-8 · Cited by 39
Quantum Dot Channel (QDC) Field-Effect Transistors (FETs) Using II–VI Barrier Layers
Jain, F., Karmakar, S., Chan, P. ‐., Suarez, E., Gogna, M., Chandy, J. A., & Heller, E. K. (2012) · Journal of Electronic Materials · doi:10.1007/s11664-012-2161-z · Cited by 39
K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You
Hazen, A., & Pelletier, F. J. (2019) · Synthese Library/Synthese library · doi:10.1007/978-3-030-31136-0_11 · Cited by 38
Grounded fixpoints and their applications in knowledge representation
Bogaerts, B., Vennekens, J., & Denecker, M. (2015) · Artificial Intelligence · doi:10.1016/j.artint.2015.03.006 · Cited by 38
On the impact of forgetting on learning machines
Freivalds, R., Kinber, E. B., & Smith, C. H. (1995) · Journal of the ACM · doi:10.1145/227683.227685 · Cited by 37
Theory of Algorithms and Discrete Processors
Глушков, В. М., & Letichevskiĭ, A. A. (1969) · Springer eBooks · doi:10.1007/978-1-4615-9050-7_1 · Cited by 37
Ordinal mind change complexity of language identification
Ambainis, A., Jain, S. K., & Sharma, A. (1999) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00005-5 · Cited by 36
The Psychology of Uncertainty and Three-Valued Truth Tables
Baratgin, J., Politzer, G., Over, D. E., & Takahashi, T. (2018) · Frontiers in Psychology · doi:10.3389/fpsyg.2018.01479 · Cited by 35
Fuzzy query interface for a business database
Ribeiro, R. A., & Moreira, A. (2003) · International Journal of Human-Computer Studies · doi:10.1016/s1071-5819(03)00010-7 · Cited by 35
Boolean elements in Lukasiewicz algebras, I
Cignoli, R. (1965) · Proceedings of the Japan Academy Series A Mathematical Sciences · doi:10.3792/pja/1195522292 · Cited by 35
Robust Cooperation in the Prisoner's Dilemma: Program Equilibrium via Provability LogicPreprint
Bárász, M., Christiano, P. F., Fallenstein, B., Herreshoff, M., LaVictoire, P., & Yudkowsky, E. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.5577 · Cited by 35
Fundamental constraints to the logic of living systems
Solé, R., Kempes, C. P., Corominas-Murtra, B., De Domenico, M., Kolchinsky, A., Lachmann, M., Libby, E., Saavedra, S., Smith, E., & Wolpert, D. (2024) · Interface Focus · doi:10.1098/rsfs.2024.0010 · Cited by 34
An Algebraic View of Super-Belnap Logics
Albuquerque, H., Přenosil, A., & Rivieccio, U. (2017) · Studia Logica · doi:10.1007/s11225-017-9739-7 · Cited by 34
A many-valued semantics for category mistakes
Martin, J. N. T. (1975) · Synthese · doi:10.1007/bf00869471 · Cited by 33
What linguists are talking about when talking about…
Lobina, D. J. (2014) · Language Sciences · doi:10.1016/j.langsci.2014.05.006 · Cited by 33
Seldin, J. P. (2009) · Handbook of the history of logic · doi:10.1016/s1874-5857(09)70019-6 · Cited by 33
Turing’s Analysis of Computability, and Major Applications of It
Kleene, S. C. (1995) · Computerkultur · doi:10.1007/978-3-7091-6597-3_2 · Cited by 33
Self-citationTernary Logic Gates Using Quantum Dot Gate FETs (QDGFETs)
Karmakar, S. (2014) · Silicon · doi:10.1007/s12633-013-9175-x · Cited by 32
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.