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 101–200 of 909
Recursive Functionals and Quantifiers of Finite Types Revisited I
Kleene, S. C. (1978) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70933-9 · Cited by 32
Self-citationExtending Floyd-Hoare Logic for Partial Pre- and Postconditions
Kryvolap, A., Nikitchenko, M. S., & Schreiner, W. (2013) · Communications in computer and information science · doi:10.1007/978-3-319-03998-5_18 · Cited by 31
The extended calculus of indications interpreted as a three-valued logic.
Varela, F. J. (1979) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093882412 · Cited by 31
Orderings and Boolean algebras not isomorphic to recursive ones
Feiner, L. (1967) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 31
Correspondence analysis for strong three-valued logic
Tamminga, A. (2014) · Logical Investigations · doi:10.21146/2074-1472-2014-20-0-253-266 · Cited by 31
A Fundamental Non-Classical Logic
Holliday, W. H. (2023) · Logics · doi:10.3390/logics1010004 · Cited by 30
Bergstra, J. A., & Alban Ponse, A. (2011) · ACM Transactions on Computational Logic · doi:10.1145/1929954.1929958 · Cited by 30
The Mathematical Import of Zermelo's Well-Ordering Theorem
Kanamori, A. (1997) · Bulletin of Symbolic Logic · doi:10.2307/421146 · Cited by 30
A Recursion Theoretic Approach to Program Testing
Cherniavsky, J. C., & Smith, C. H. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.233489 · Cited by 30
Angluin, D., Gasarch, W. I., & Smith, C. H. (1989) · Theoretical Computer Science · doi:10.1016/0304-3975(89)90153-9 · Cited by 30
Automatic Proofs and Refutations for Higher-Order Logic
Blanchette, J. C. (2012) · Cited by 30
A Brief History of Determinacy
Larson, P. (2012) · Handbook of the history of logic · doi:10.1016/b978-0-444-51621-3.50006-2 · Cited by 29
Enumerating fuzzy switching functions and free kleene algebras
Berman, J. D., & Mukaidono, M. (1984) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(84)90083-x · Cited by 28
Truthmaking, truth, and realism: new work for a theory of truthmakers
Asay, J. (2011) · Carolina Digital Repository (University of North Carolina at Chapel Hill) · doi:10.17615/zhfr-2879 · Cited by 28
Rational Agency from a Truth-Functional Perspective
Kubyshkina, E., & Zaitsev, D. V. (2016) · Logic and Logical Philosophy · doi:10.12775/llp.2016.016 · Cited by 27
Fixpoint semantics for active integrity constraints
Bogaerts, B., & Cruz-Filipe, L. (2017) · Artificial Intelligence · doi:10.1016/j.artint.2017.11.003 · Cited by 27
Semantical analysis of weak Kleene logics
Ciuni, R., & Carrara, M. (2019) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.2018.1547514 · Cited by 27
A generalization of the Second Incompleteness Theorem and some exceptions to it
Willard, D. E. (2006) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2005.12.010 · Cited by 27
Constructive definition of certain analytic sets of numbers
Lorenzen, P., & Myhill, J. R. (1959) · Journal of Symbolic Logic · doi:10.2307/2964572 · Cited by 27
Non-Transitivism and the Sorites Paradox
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.010 · Cited by 26
Gödel's Incompleteness Theorems
Kennedy, J. C. (2022) · Cambridge University Press eBooks · doi:10.1017/9781108981972 · Cited by 26
Caracterisation des algèbres de Nelson par des egalités, II
Brignole, D., & Monteiro, A. (1967) · Proceedings of the Japan Academy Series A Mathematical Sciences · doi:10.3792/pja/1195521625 · Cited by 26
Gottwald, S. (2007) · Elsevier eBooks · doi:10.1016/b978-044451541-4/50021-x · Cited by 26
Missing values and dragonfly operations in fuzzy relational compositions
Štěpnička, M., Cao, N., Běhounek, L., Burda, M., & Dolný, A. (2019) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2019.07.004 · Cited by 25
Intensionality, Definability and Computation
Abramsky, S. (2014) · Outstanding contributions to logic · doi:10.1007/978-3-319-06025-5_5 · Cited by 25
(S,N)-Implications on Bounded Lattices
Bedregal, B., Beliakov, G., Bustince, H., Fernández, J., Pradera, A., & Reiser, R. (2013) · Studies in fuzziness and soft computing · doi:10.1007/978-3-642-35677-3_5 · Cited by 25
Willard, D. E. (2005) · Journal of Symbolic Logic · doi:10.2178/jsl/1129642122 · Cited by 25
Key notions of Tarski's methodology of deductive systems
Czelakowski, J., & Malinowski, G. (1985) · Studia Logica · doi:10.1007/bf00370426 · Cited by 25
Three-valued predicates for software specification and validation
Blikle, A. (1988) · Lecture notes in computer science · doi:10.1007/3-540-50214-9_20 · Cited by 25
Sundholm, G. (2014) · Logic, epistemology, and the unity of science · doi:10.1007/978-94-017-9217-2_1 · Cited by 24
Inductive Inference with Procrastination: Back to Definitions
Ambainis, A., Freivalds, R., & Smith, C. H. (1999) · Fundamenta Informaticae · doi:10.3233/fi-1999-40101 · Cited by 24
When linguists talk mathematical logic
Lobina, D. J. (2014) · Frontiers in Psychology · doi:10.3389/fpsyg.2014.00382 · Cited by 23
Epistemicism and the Sorites Paradox
Oms, S., Oms, S., & Oms, S. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.002 · Cited by 23
Jaśkowski's criterion and three-valued paraconsistent logics
Karpenko, A. S. (2004) · Logic and Logical Philosophy · doi:10.12775/llp.1999.006 · Cited by 23
Three-valued Logics in Modal Logic
Kooi, B. P., & Tamminga, A. (2012) · Studia Logica · doi:10.1007/s11225-012-9420-0 · Cited by 23
Quaternary Voltage-Mode Logic Cells and Fixed-Point Multiplication Circuits
Datla, S., & Thornton, M. A. (2010) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2010.32 · Cited by 23
Natural Deduction for Three-Valued Regular Logics
Игоревич, П. Я. (2016) · Logic and Logical Philosophy · doi:10.12775/llp.2016.025 · Cited by 23
Béziau, J.-Y. (2012) · Handbook of the history of logic · doi:10.1016/b978-0-444-52937-4.50005-8 · Cited by 23
Many-valued Logics of Continuous t-norms and Their Functional Representation
Gerla, B. (2001) · Cited by 23
Remarks on the development of computability
Shapiro, S. (1983) · History and Philosophy of Logic · doi:10.1080/01445348308837055 · Cited by 23
A Revised Concept of Safety for General Answer Set Programs
Cabalar, P., Pearce, D., & Valverde, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04238-6_8 · Cited by 22
Two Genuine 3-Valued Paraconsistent Logics
Béziau, J.-Y. (2016) · Intelligent systems reference library · doi:10.1007/978-3-319-40418-9_4 · Cited by 22
Program equilibria and discounted computation time
Fortnow, L. (2009) · Theoretical Aspects of Rationality and Knowledge · doi:10.1145/1562814.1562833 · Cited by 22
Factorization over finitely generated fields
Davenport, J. H., & Trager, B. (1981) · ACM Symposium on Symbolic and Algebraic Computation (SYMSAC) · doi:10.1145/800206.806396 · Cited by 22
Three decades of team learning
Smith, C. H. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58520-6_66 · Cited by 22
A Deep Study of Fuzzy Implications
Shi, Y. B. (2009) · Ghent University Academic Bibliography (Ghent University) · Cited by 22
Incoherentism and the Sorites Paradox
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.005 · Cited by 21
Textures and fuzzy unit operations in rough set theory: An approach to fuzzy rough set models
Diker, M. (2017) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2017.06.009 · Cited by 21
On the characterizations of fuzzy implications satisfying I(x,I(y,z))=I(I(x,y),I(x,z))
Cruz, A. P., Bedregal, B., & Santiago, R. H. N. (2017) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2017.11.004 · Cited by 21
Consistency Enforcement in Databases
Link, S. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36596-6_8 · Cited by 21
Recursive Functionals and Quantifiers of Finite Types Revisited II
(1980) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71251-5 · Cited by 21
Fuzzy reasoning method by optimizing the similarity of truth-tables
Deng, G., & Jiang, Y. (2014) · Information Sciences · doi:10.1016/j.ins.2014.08.006 · Cited by 20
Arbitration based framework for design of holisticmultimodal human-machine interaction
Kelsch, J., Temme, G., & Schindler, J. (2013) · elib (German Aerospace Center) · Cited by 20
Simulating Dynamic Systems Using Linear Time Calculus Theories
Bogaerts, B., JANSEN, J., Bruynooghe, M., CAT, B. D., Vennekens, J., & Denecker, M. (2014) · Theory and Practice of Logic Programming · doi:10.1017/s1471068414000155 · Cited by 20
Supervaluationism and Paraconsistency
Varzi, A. C. (2000) · PhilPapers (PhilPapers Foundation) · Cited by 20
Proclus and the Neoplatonic Syllogistic
Martin, J. N. T. (2001) · Journal of Philosophical Logic · doi:10.1023/a:1017521712962 · Cited by 20
Arslanov, M. M. (2011) · IMPERIAL COLLEGE PRESS eBooks · doi:10.1142/9781848162778_0003 · Cited by 20
A Three-Valued Logic for Software Specification and Validation. Tertium tamen datur
Konikowska, B., Tarlecki, A., & Blikle, A. (1991) · Fundamenta Informaticae · doi:10.3233/fi-1991-14403 · Cited by 20
Computability on the space of countable ordinalsPreprint
Pauly, A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1501.00386 · Cited by 20
Efficient Well-Definedness Checking
Darvas, Á., Mehta, F., & Rudich, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-71070-7_8 · Cited by 19
Recursive Functionals and Quantifiers of Finite Types Revisited, V
Kleene, S. C. (1991) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1991-0974519-8 · Cited by 19
Self-citationHierarchies in Recursive Function Theory
Enderton, H. B. (1964) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1964-0159755-9 · Cited by 19
Multiple-valued LogicsPreprint
Panti, G. (1995) · arXiv (Cornell University) · doi:10.48550/arxiv.math/9504202 · Cited by 19
Generalized Correspondence Analysis for Three-Valued Logics
Игоревич, П. Я. (2018) · Logica Universalis · doi:10.1007/s11787-018-0212-9 · Cited by 18
Crossley, J. N., & Kister, J. B. (1987) · Archive for Mathematical Logic · doi:10.1007/bf02017491 · Cited by 18
Ad and the uniqueness of the supercompact measures on Pω1(λ)
Woodin, W. H. (2006) · Springer eBooks · doi:10.1007/bfb0071694 · Cited by 18
Constructive Versions of Ordinal Number Classes
Kreider, D. L., & Rogers, H. (1961) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1961-0151396-x · Cited by 18
On the role of procrastination for machine learning
Freivalds, R., & Smith, C. H. (1992) · Conference on Learning Theory · doi:10.1145/130385.130426 · Cited by 18
Dependent Type Theory with Parameterized First-Order Data Types and Well-Founded Recursion
Wahlstedt, D. (2007) · Chalmers Publication Library (Chalmers University of Technology) · Cited by 18
Eine modulare Architektur für dienstbasierte Interaktionen zwischen Agenten
Sesseler, R. (2002) · DepositOnce · doi:10.14279/depositonce-515 · Cited by 18
Universal Prediction: A Philosophical Investigation
Sterkenburg, T. F. (2018) · University of Groningen research database (University of Groningen / Centre for Information Technology) · Cited by 18
Correspondence analysis and automated proof-searching for first degree entailment
Игоревич, П. Я., & Shangin, V. (2019) · European Journal of Mathematics · doi:10.1007/s40879-019-00344-5 · Cited by 18
Normalisation for Some Quite Interesting Many-Valued Logics
Kürbis, N., & Игоревич, П. Я. (2021) · Logic and Logical Philosophy · doi:10.12775/llp.2021.009 · Cited by 17
Lazy product discovery in huge configuration spaces
Lienhardt, M., Damiani, F., Johnsen, E. B., & Mauro, J. (2020) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/3377811.3380372 · Cited by 17
From Turing machines to computer viruses
Marion, J.-Y. (2012) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2011.0332 · Cited by 17
Strong Three-Valued Paraconsistent Logics
Béziau, J.-Y., & Franceschetto, A. (2015) · Springer proceedings in mathematics & statistics · doi:10.1007/978-81-322-2719-9_5 · Cited by 17
REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS
Avron, A., & Zohar, Y. (2018) · The Review of Symbolic Logic · doi:10.1017/s1755020318000321 · Cited by 17
Self-replicating and self-modifying programs in fraglets
Yamamoto, L., Schreckling, D., & Meyer, T. A. (2007) · Bioinspired Models of Network, Information, and Computing Systems · doi:10.1109/bimnics.2007.4610104 · Cited by 17
Kleene's three-valued logic and process algebra
Bergstra, J. A., & Alban Ponse, A. (1998) · Information Processing Letters · doi:10.1016/s0020-0190(98)00083-0 · Cited by 17
On Denumerable Bases of Formal Systems
Wang, H. (1955) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70304-0 · Cited by 17
Willard, D. E. (2006) · Journal of Symbolic Logic · doi:10.2178/jsl/1164060451 · Cited by 17
Origins of recursive function theory
Kleene, S. C. (1979) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1979.33 · Cited by 17
Self-citationShinren: Non-monotonic Trust Management for Distributed Systems
Dong, C., & Dulay, N. (2010) · IFIP International Federation for Information Processing/IFIP · doi:10.1007/978-3-642-13446-3_9 · Cited by 16
Fixed point theorems for precomplete numberings
Barendregt, H. P., & Terwijn, S. A. (2019) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2019.04.013 · Cited by 16
Construction theory, self‐replication, and the halting problem
Sayama, H. (2008) · Complexity · doi:10.1002/cplx.20218 · Cited by 16
A tableau style proof system for two paraconsistent logics.
Bloesch, A. (1993) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093634659 · Cited by 16
Turing degrees in Polish spaces and decomposability of Borel functions
Gregoriades, V., Kihara, T., & Ng, K. M. (2020) · Journal of Mathematical Logic · doi:10.1142/s021906132050021x · Cited by 16
Varzi, A. C., & Warglien, M. (2003) · Journal of Applied Non-Classical Logics · doi:10.3166/jancl.13.9-19 · Cited by 16
Mind Change Complexity of Learning Logic Programs
Jain, S. K., & Sharma, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49097-3_16 · Cited by 16
Process algebra with four-valued logic
Bergstra, J. A., & Alban Ponse, A. (2000) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.2000.10510987 · Cited by 16
Remarks on an infinitary language with constructive formulas
López‐Escobar, E. (1967) · Journal of Symbolic Logic · doi:10.2307/2270771 · Cited by 16
On the Complexity of Hazard-free Circuits
Ikenmeyer, C., Komarath, B., Lenzen, C., Lysikov, V., Mokhov, A., & Sreenivasaiah, K. (2019) · Journal of the ACM · doi:10.1145/3320123 · Cited by 15
Extremal numberings and fixed point theorems
Faĭzrahmanov, M. K. (2022) · Mathematical logic quarterly · doi:10.1002/malq.202200035 · Cited by 15
Picollo, L. (2018) · The Review of Symbolic Logic · doi:10.1017/s1755020317000351 · Cited by 15
The Strict/Tolerant Idea and Bilattices
Fitting, M. (2021) · Outstanding contributions to logic · doi:10.1007/978-3-030-71258-7_8 · Cited by 15
On Learning Multiple Concepts in Parallel
Kinber, E. B., Smith, C. H., Velauthapillai, M., & Wiehagen, R. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1005 · Cited by 15
The Mathematical Work of S.C.Kleene
Shoenfield, J. R. (1995) · Bulletin of Symbolic Logic · doi:10.2307/420945 · Cited by 15
Trivial Dialetheism and the Logic of Paradox
Béziau, J.-Y. (2015) · Logic and Logical Philosophy · doi:10.12775/llp.2015.022 · Cited by 15
Another proof of the Markov—Post theorem
Kalmár, L. (1952) · Acta Mathematica Academiae Scientiarum Hungaricae · doi:10.1007/bf02146065 · Cited by 15
Parsimony hierarchies for inductive inference
Ambainis, A., Case, J., Jain, S. K., & Suraj, M. (2004) · Journal of Symbolic Logic · doi:10.2178/jsl/1080938842 · Cited by 15
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.