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 201–300 of 909
Partial Komori fields and imperative Komori fieldsPreprint
Bergstra, J. A., & Middelburg, C. A. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0909.5271 · Cited by 15
Martin, D. A. (2020) · Cambridge University Press eBooks · doi:10.1017/9781316863534.005 · Cited by 14
A Potential Subtlety Concerning the Distinction between Determinism and Nondeterminism
Woodin, W. H. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511976889.007 · Cited by 14
Jacques Herbrand: Life, Logic, and Automated Deduction
Wirth, C.-P., Siekmann, J. H., Benzmüller, C., & Autexier, S. (2009) · Handbook of the history of logic · doi:10.1016/s1874-5857(09)70009-3 · Cited by 14
Safe inductions and their applications in knowledge representation
Bogaerts, B., Vennekens, J., & Denecker, M. (2018) · Artificial Intelligence · doi:10.1016/j.artint.2018.03.008 · Cited by 14
Recursion: A Computational Investigation into the Representation and Processing of Language
Lobina, D. J. (2017) · doi:10.1093/oso/9780198785156.001.0001 · Cited by 14
Spatio-Temporal Stream Reasoning with Incomplete Spatial Information
Heintz, F., & Daniel, D. L. (2014) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-61499-419-0-429 · Cited by 14
FUZZY POWER SETS AND FUZZY IMPLICATION OPERATORS
Bandler, W., & Kohout, L. (1993) · Elsevier eBooks · doi:10.1016/b978-1-4832-1450-4.50012-2 · Cited by 14
Ordinal Numbers and Predicative Set Theory
Wang, H. (1959) · Mathematical logic quarterly · doi:10.1002/malq.19590051403 · Cited by 14
Cut Elimination, Identity Elimination, and Interpolation in Super-Belnap Logics
Přenosil, A. (2017) · Studia Logica · doi:10.1007/s11225-017-9746-8 · Cited by 13
Fixed-point Selection Functions
Arslanov, M. M. (2021) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080221040041 · Cited by 13
A domain-specific language for modeling and analyzing solution spaces for technology roadmapping
Breckel, A., Pietron, J., Juhnke, K., Sihler, F., & Tichy, M. (2021) · Journal of Systems and Software · doi:10.1016/j.jss.2021.111094 · Cited by 13
Knowledge compilation of logic programs using approximation fixpoint theory
Bogaerts, B., & BROECK, G. V. D. (2015) · Theory and Practice of Logic Programming · doi:10.1017/s1471068415000162 · Cited by 13
Natural Deduction for Four-Valued both Regular and Monotonic Logics
Игоревич, П. Я. (2017) · Logic and Logical Philosophy · doi:10.12775/llp.2017.001 · Cited by 13
Null Values in Relational Databases and Sure Information Answers
Hans-Joachim, K. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36596-6_7 · Cited by 13
On intermediate many-valued logics.
Umezawa, T. (1959) · Journal of the Mathematical Society of Japan · doi:10.2969/jmsj/01120116 · Cited by 13
Simulating Dynamic Systems Using Linear Time Calculus TheoriesPreprint
Bogaerts, B., Jansen, J., Bruynooghe, M., Cat, B. D., Vennekens, J., & Denecker, M. (n.d.) · Cited by 13
A Generalization of ACP Using Belnap's Logic
Alban Ponse, A., & van der Zwaag, M. B. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.12.102 · Cited by 12
AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX
Игоревич, П. Я., & Shangin, V. (2017) · The Review of Symbolic Logic · doi:10.1017/s1755020317000156 · Cited by 12
Using Four-Valued Signal Temporal Logic for Incremental Verification of Hybrid Systems
Lercher, F., & Althoff, M. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-65633-0_12 · Cited by 12
Stability, Supportedness, Minimality and Kleene Answer Set Programs
Doherty, P., & Szałas, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-14726-0_9 · Cited by 12
Classes of Polish spaces under effective Borel isomorphism
Gregoriades, V. (2015) · Memoirs of the American Mathematical Society · doi:10.1090/memo/1135 · Cited by 12
Distributed Autoepistemic Logic and its Application to Access Control
Hertum, P. V., Cramer, M., Bogaerts, B., & Denecker, M. (2016) · Lirias · Cited by 12
Exactly true and non-falsity logics meeting infectious ones
Belikov, A., & Игоревич, П. Я. (2020) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.2020.1751573 · Cited by 12
Constructive Theory of Ordinals
Coquand, T., Lombardi, H., & Neuwirth, S. (2023) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789811245220_0012 · Cited by 11
Type-theoretic approaches to ordinals
Kraus, N., Forsberg, F. N., & Xu, C. (2023) · Theoretical Computer Science · doi:10.1016/j.tcs.2023.113843 · Cited by 11
Set-Theoretic and Type-Theoretic Ordinals Coincide
de Jong, T., Kraus, N., Forsberg, F. N., & Xu, C. (2023) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics56636.2023.10175762 · Cited by 11
Stone-Type Representations and Dualities for Varieties of Bisemilattices
Ledda, A. (2017) · Studia Logica · doi:10.1007/s11225-017-9745-9 · Cited by 11
Игоревич, П. Я., & Shangin, V. (2018) · Logic and Logical Philosophy · doi:10.12775/llp.2018.009 · Cited by 11
Compositions of Partial Fuzzy Relations Employing the Lower Estimation Approach
Cao, N., & Štěpnička, M. (2018) · International Conference on Knowledge and Systems Engineering/Proceedings · doi:10.1109/kse.2018.8573362 · Cited by 11
THE LATTICE OF SUPER-BELNAP LOGICS
Přenosil, A. (2021) · The Review of Symbolic Logic · doi:10.1017/s1755020321000204 · Cited by 11
Distance-based Judgment Aggregation of Three-valued Judgments with Weights
Slavkovik, M., & Jamroga, W. (2011) · Open Repository and Bibliography (University of Luxembourg) · Cited by 11
Willard, D. E. (2009) · Information and Computation · doi:10.1016/j.ic.2008.11.007 · Cited by 11
Eichler, C., Thierry Monteil, A., Stolf, P., Grieco, L. A., & Drira, K. (2014) · Software & Systems Modeling · doi:10.1007/s10270-014-0433-1 · Cited by 11
GENERALIZATIONS OF THE RECURSION THEOREM
Terwijn, S. A. (2018) · Journal of Symbolic Logic · doi:10.1017/jsl.2018.52 · Cited by 11
On the impact of forgetting on learning machines
Freivalds, R., Kinber, E. B., & Smith, C. H. (1993) · Conference on Learning Theory · doi:10.1145/168304.168326 · Cited by 11
Ordinal mind change complexity of language identification
Ambainis, A., Jain, S. K., & Sharma, A. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62685-9_25 · Cited by 11
On chemical and self-healing networking protocols
Meyer, T. (2011) · edoc (University of Basel) · doi:10.5451/unibas-005581929 · Cited by 11
P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
Zemke, F. (1977) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1977-0498045-0 · Cited by 11
Not-so-nearly-minimal-size program inference (preliminary report)
Case, J., Suraj, M., & Jain, S. K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60217-8_5 · Cited by 11
Correspondence Analysis for First Degree Entailment
Петрухин, Я. И. (2016) · Logical Investigations · doi:10.21146/2074-1472-2016-22-1-108-124 · Cited by 11
Truth Set Algebra: A New Way to Prove UndefinabilityPreprint
Knight, S., Naumov, P., Shi, Q., & Suntharraj, V. (2022) · ePrints Soton (University of Southampton) · doi:10.48550/arxiv.2208.04422 · Cited by 11
Yue, P. (2025) · Mathematics · doi:10.3390/math13030496 · Cited by 10
Argument-based inductive logics, with coverage of compromised perception
Bringsjord, S., Giancola, M., Govindarajulu, N. S., Slowik, J., Oswald, J. T., Bello, P., & Clark, M. H. (2024) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2023.1144569 · Cited by 10
A Single-Type Semantics for Natural Language
Liefke, K. (2014) · PhilPapers (PhilPapers Foundation) · Cited by 10
On fixed-point theorems in synthetic computability
Bauer, A. (2017) · Advanced Studies Euro-Tbilisi Mathematical Journal · doi:10.1515/tmj-2017-0107 · Cited by 10
Fuzzy rough set models over two universes using textures
Diker, M., & Uğur, A. A. (2021) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2021.10.014 · Cited by 10
Solving Fixed-Point Equations by Derivation Tree Analysis
Esparza, J., & Luttenberger, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22944-2_2 · Cited by 10
On Well-Founded Set-Inductions and Locally Monotone Operators
Bogaerts, B., Vennekens, J., & Denecker, M. (2016) · ACM Transactions on Computational Logic · doi:10.1145/2963096 · Cited by 10
Generalised Tarski’s Thesis Hits Substructure
Zardini, E. (2018) · Springer eBooks · doi:10.1007/978-3-319-98346-2_11 · Cited by 10
Stratification in Approximation Fixpoint Theory and Its Application to Active Integrity Constraints
Bogaerts, B., & Cruz-Filipe, L. (2021) · ACM Transactions on Computational Logic · doi:10.1145/3430750 · Cited by 10
Lobina, D. J. (2014) · Cognitive Processing · doi:10.1007/s10339-014-0619-z · Cited by 10
de Brecht, M., & Yamamoto, A. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.11.004 · Cited by 10
Towards Tractable Inference for Resource-Bounded Agents
Klassen, T. Q., McIlraith, S. A., & Levesque, H. J. (2015) · National Conference on Artificial Intelligence · Cited by 10
Recursive Functionals and Quantifiers of Finite Types Revisited III
Kleene, S. C. (1982) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71355-7 · Cited by 10
Self-citationThe logic and mathematics of occasion sentences
Seuren, P. A. M., Capretta, V., & Geuvers, H. (2001) · Linguistics and Philosophy · doi:10.1023/a:1017592000325 · Cited by 10
The power of procrastination in inductive inference: How it depends on used ordinal notations
Ambainis, A. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59119-2_171 · Cited by 10
Automated Theorem Proving in Multiple Valued Logics
Hähnle, R., Project M. D'agostino, Dix, J., Gent, I., Kummer, M., Lu, J., Ludascher, B., Murray, N., Posegga, J., Reif, W., et al. (n.d.) · Cited by 10
The reverse mathematics of Ramsey-type theoremsPreprint
Patey, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.04428 · Cited by 10
Ternary Matrix Factorization: problem definitions and algorithms
Maurus, S., & Plant, C. (2015) · Knowledge and Information Systems · doi:10.1007/s10115-015-0838-3 · Cited by 9
DeRDaVa: Deletion-Robust Data Valuation for Machine Learning
Xiao, T., Sim, R. H. L., Fan, J., & Low, B. K. H. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i14.29462 · Cited by 9
Connecting Constructive Notions of Ordinals in Homotopy Type Theory
Kraus, N., Forsberg, F. N., & Xu, C. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.mfcs.2021.70 · Cited by 9
A probabilistic analysis of selected notions of iterated conditioning under coherence
Castronovo, L., & Sanfilippo, G. (2023) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2023.109088 · Cited by 9
Maurus, S., & Plant, C. (2014) · Proceedings · doi:10.1109/icdm.2014.40 · Cited by 9
Many-valued logics and the logic of the C programming language
Nagy, B. (2005) · ITI ... · doi:10.1109/iti.2005.1491200 · Cited by 9
A multiple-valued logic approach to the design and verification of hardware circuits
Rosenmann, A. (2016) · Journal of Applied Logic · doi:10.1016/j.jal.2016.01.001 · Cited by 9
Convex MV-Algebras: Many-Valued Logics Meet Decision Theory
Flaminio, T., Hosni, H., & Lapenta, S. (2017) · Studia Logica · doi:10.1007/s11225-016-9705-9 · Cited by 9
Natural Deduction for Fitting’s Four-Valued Generalizations of Kleene’s Logics
Игоревич, П. Я. (2017) · Logica Universalis · doi:10.1007/s11787-017-0169-0 · Cited by 9
LOGICAL ANALYSES OF VIPASSANĀ MEDITATION
Hertogh, C. P. (2018) · Contemporary Buddhism · doi:10.1080/14639947.2018.1498604 · Cited by 9
Gramelsberger, G. (2020) · Felix Meiner Verlag eBooks · doi:10.28937/978-3-7873-3900-6 · Cited by 9
Malinowski, G. (2006) · Wiley eBooks · doi:10.1002/9780470996751.ch35 · Cited by 9
A Logic-Algebraic Approach to Graded Inclusion
Gomolińska, A. (2011) · Fundamenta Informaticae · doi:10.3233/fi-2011-510 · Cited by 9
Blanchette, J. C. (2011) · Software Quality Journal · doi:10.1007/s11219-011-9148-5 · Cited by 9
Schindler, R. (2010) · De Gruyter eBooks · doi:10.1515/9783110324907 · Cited by 9
Probabilistic inductive inference: a survey
Ambainis, A. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00218-8 · Cited by 9
ISOMORPHISMS OF SPENCER-BROWN'S LAWS OF FORM AND VARELA'S CALCULUS FOR SELF-REFERENCE†
Schwartz, D. G. (1981) · International Journal of General Systems · doi:10.1080/03081078108934802 · Cited by 9
Self-Replicating and Self-Modifying Programs in Fraglets
Yamamoto, L., Schreckling, D., & Meyer, T. A. (2007) · International Conference on Bio-Inspired Models of Network, Information and Computing Systems (BIONETICS) · doi:10.4108/icst.bionetics2007.2446 · Cited by 9
Extensions of the constructive ordinals
Richter, W. (1965) · Journal of Symbolic Logic · doi:10.2307/2270134 · Cited by 9
Groundedness in logics with a fixpoint semantics
Bogaerts, B. (2015) · Lirias · doi:10.13140/rg.2.1.2740.8484 · Cited by 9
Monoidal Computer III: A Coalgebraic View of Computability and Complexity (Extended Abstract)
Pavlović, D., & Yahia, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-00389-0_10 · Cited by 8
Dialetheism and the Sorites Paradox
Oms, S., & Zardini, E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316683064.008 · Cited by 8
Non-deterministic structures of computation
Fu, Y. (2014) · Mathematical Structures in Computer Science · doi:10.1017/s0960129514000012 · Cited by 8
ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS
Shafer, P., & Terwijn, S. A. (2021) · Journal of Symbolic Logic · doi:10.1017/jsl.2021.50 · Cited by 8
Fast growing functions based on Ramsey theorems
Prömel, H. J., & Thumser, W. (1991) · Discrete Mathematics · doi:10.1016/0012-365x(91)90346-4 · Cited by 8
Formalism and intuition in computability
Soare, R. I. (2012) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2011.0335 · Cited by 8
Reasoning Processes as Epistemic Dynamics
Velázquez–Quesada, F. R. (2014) · Axiomathes · doi:10.1007/s10516-014-9255-6 · Cited by 8
Bogaerts, B., Vennekens, J., & Denecker, M. (2015) · Lirias · Cited by 8
Two Problems for Sophistication
Bloem, P., de Rooij, S., & Adriaans, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24486-0_25 · Cited by 8
Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)
Pauly, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48057-1_32 · Cited by 8
Modified Ternary Karnaugh Map and Logic Synthesis in Ternary Quantum Dot Cellular Automata
Das, K., De, D., & De, M. (2016) · IETE Journal of Research · doi:10.1080/03772063.2016.1176541 · Cited by 8
La Logique Mathématique en sa jeunesse
Guillaume, M. (1994) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-9114-1_5 · Cited by 8
On the Semantics of Intensionality
Kavvos, G. A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-662-54458-7_32 · Cited by 8
Bergstra, J. A., & Bethke, I. (2002) · The Journal of Logic and Algebraic Programming · doi:10.1016/s1567-8326(02)00021-8 · Cited by 8
A syntactic characterization of Kleene's strong connectives with two designated values
Martin, J. N. T. (1975) · Mathematical logic quarterly · doi:10.1002/malq.19750210124 · Cited by 8
Logics for Approximate Reasoning: Approximating Classical Logic “From Above”
Finger, M., & Wassermann, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36127-8_3 · Cited by 8
A Note on Computable Functionals
Kleene, S. C. (1956) · Indagationes Mathematicae (Proceedings) · doi:10.1016/s1385-7258(56)50037-6 · Cited by 8
Self-citationLectures on Jacques Herbrand as a LogicianPreprint
Wirth, C.-P., Siekmann, J., Benzmüller, C., & Autexier, S. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0902.4682 · Cited by 8
Functional Programming and Erratic Non-Determinism
Pitcher, C., Ong, C.-H. L., & Wallen, L. A. (2001) · Cited by 8
Effective mathematics — the computer algebra viewpoint
Davenport, J. H. (1981) · Lecture notes in mathematics · doi:10.1007/bfb0090725 · Cited by 8
Partial closures and semantics of while: Towards an iteration-based theory of data types
Germano, G., & Mazzanti, S. (1984) · Lecture notes in mathematics · doi:10.1007/bfb0099485 · Cited by 8
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.