The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Zur Hilbertschen Beweistheorie
v. Neumann, J. (1927) · Mathematische Zeitschrift · doi:10.1007/bf01475439 · Cited by 179
Fraenkel, A. (1927) · Zehn Vorlesungen Über die Grundlegung der Mengenlehre · doi:10.1007/978-3-663-15741-0_3
Research works printed but not linked: 2
- A. Whitehead und B. Russell, Principia Mathematica, 2. Aufl., Cambridge 1925. Zu den Axiomen des Systems PM rechnen wir insbesondere auch: Das Unendlichkeitsaxiom (in der Form: es gibt genau abzählbar viele Individuen), das Reduzibilitäts- und das Auswahlaxiom (für alle Typen).
- Vgl. J. v. Neumann, Zur Hilbertschen Beweistheorie, Math. Zeitschr. 26, 1927. · DOI · Paper page
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
I.—COMPUTING MACHINERY AND INTELLIGENCE
TURING, A. M. (1950) · Mind · doi:10.1093/mind/lix.236.433 · Cited by 10,290
Recursively enumerable sets and degrees
Soare, R. I. (1978) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1978-14552-2 · Cited by 1,520
Muggleton, S. (1991) · New Generation Computing · doi:10.1007/bf03037089 · Cited by 1,044
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
Montague, P. R., Dolan, R. J., Friston, K. J., & Dayan, P. (2012) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2011.11.018 · Cited by 809
Completeness in the theory of types
Henkin, L. (1950) · Journal of Symbolic Logic · doi:10.2307/2266967 · Cited by 845
What you always wanted to know about Datalog (and never dared to ask)
Ceri, S., Gottlob, G., & Tanca, L. (1989) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.43410 · Cited by 700
Interpretation of AF C∗-algebras in Łukasiewicz sentential calculus
Mundici, D. (1986) · Journal of Functional Analysis · doi:10.1016/0022-1236(86)90015-7 · Cited by 698
COMPUTING MACHINERY AND INTELLIGENCE
TURING, A. M. (1988) · Readings in Cognitive Science · doi:10.1016/b978-1-4832-1446-7.50006-6 · Cited by 678
Die Widerspruchsfreiheit der reinen Zahlentheorie
Gentzen, G. (1936) · Mathematische Annalen · doi:10.1007/bf01565428 · Cited by 614
General recursive functions of natural numbers
Kleene, S. C. (1936) · Mathematische Annalen · doi:10.1007/bf01565439 · Cited by 593
Metrics and laws of software evolution-the nineties view
Lehman, M. M., Ramil, J. F., Wernick, P. D., Perry, D. E., & Turski, W. M. (2002) · Proceedings Fourth International Software Metrics Symposium · doi:10.1109/metric.1997.637156 · Cited by 561
“This is of course mathematically intractable posing a fundamental ultimate obstacle to the investigation [ god31 , leh85].”
BackgroundSystems of logic based on ordinals
(2001) · Mathematical Logic · doi:10.1016/b978-044450423-4/50007-3 · Cited by 543
On the interpretation of intuitionistic number theory
Kleene, S. C. (1945) · Journal of Symbolic Logic · doi:10.2307/2269016 · Cited by 538
The nature and plausibility of Cognitivism
Haugeland, J. (1978) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00074148 · Cited by 512
Tegmark, M. (2008) · Foundations of Physics · doi:10.1007/s10701-007-9186-9 · Cited by 463
Boolos, G. S. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9780511625183 · Cited by 427
Differential Dynamic Logic for Hybrid Systems
Platzer, A. (2008) · Journal of Automated Reasoning · doi:10.1007/s10817-008-9103-8 · Cited by 390
Toward useful type-free theories. I
Feferman, S. (1984) · Journal of Symbolic Logic · doi:10.2307/2274093 · Cited by 383
Logic in the twenties: the nature of the quantifier
Goldfarb, W. (1979) · Journal of Symbolic Logic · doi:10.2307/2273128 · Cited by 377
Scholz, R. W., Lang, D. J., Wiek, A., Walter, A. I., & Stauffacher, M. (2006) · International Journal of Sustainability in Higher Education · doi:10.1108/14676370610677829 · Cited by 360
“Hereby, validation always refers to a reference framework (Gödel, 1931) or metalevel, which determines what is considered as a true, valid or good and, respectively, as a false, invalid or bad result.”
New Foundations for Mathematical Logic
Quine, W. V. (1937) · The American Mathematical Monthly · doi:10.1080/00029890.1937.11987928 · Cited by 482
Multilanguage hierarchical logics, or: How we can do without modal logics
Giunchiglia, F., & Serafini, L. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90037-x · Cited by 343
Transfinite recursive progressions of axiomatic theories
Feferman, S. (1962) · Journal of Symbolic Logic · doi:10.2307/2964649 · Cited by 343
Recursive predicates and quantifiers
Kleene, S. C. (1943) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1943-0007371-8 · Cited by 363
Smoryński, C. (1977) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71123-6 · Cited by 336
Definability and decision problems in arithmetic
Robinson, J. (1949) · Journal of Symbolic Logic · doi:10.2307/2266510 · Cited by 314
On axiomatizability within a system
Craig, W. (1953) · Journal of Symbolic Logic · doi:10.2307/2266324 · Cited by 311
Boosting Rechargeable Batteries R&D by Multiscale Modeling: Myth or Reality?
Franco, A. A., Rucci, A., Brandell, D., Frayret, C., Gaberscek, M., Jankowski, P., & Johansson, P. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00239 · Cited by 308
Solution of a problem of Leon Henkin
Löb, M. H. (1955) · Journal of Symbolic Logic · doi:10.2307/2266895 · Cited by 303
FRANCISCO, J., & VARELA, G. (1975) · International Journal of General Systems · doi:10.1080/03081077508960828 · Cited by 293
Potter, M. (2004) · doi:10.1093/acprof:oso/9780199269730.001.0001 · Cited by 281
Developmental robotics, optimal artificial curiosity, creativity, music, and the fine arts
Schmidhuber, J. (2006) · Connection Science · doi:10.1080/09540090600768658 · Cited by 268
Soare, R. I. (1996) · Bulletin of Symbolic Logic · doi:10.2307/420992 · Cited by 268
Undecidability of the spectral gap
Cubitt, T. S., Perez-Garcia, D., & Wolf, M. M. (2015) · Nature · doi:10.1038/nature16059 · Cited by 262
A history of Haskell: being lazy with class
Hudak, P., Hughes, J., Peyton Jones, S., & Wadler, P. (2007) · Proceedings of the third ACM SIGPLAN conference on History of programming languages · doi:10.1145/1238844.1238856 · Cited by 261
The Turing Test: the first 50 years
French, R. M. (2000) · Trends in Cognitive Sciences · doi:10.1016/s1364-6613(00)01453-4 · Cited by 250
Concatenation as a basis for arithmetic
Quine, W. V. (1946) · Journal of Symbolic Logic · doi:10.2307/2268308 · Cited by 233
Computability classes for enforcement mechanisms
Hamlen, K. W., Morrisett, G., & Schneider, F. B. (2006) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1111596.1111601 · Cited by 221
(2000) · Choice Reviews Online · doi:10.5860/choice.37-6308 · Cited by 212
A Succession of Paradigms in Ecology: Essentialism to Materialism and Probabilism
Simberloff, D. (1982) · Conceptual Issues in Ecology · doi:10.1007/978-94-009-7796-9_2 · Cited by 215
The conceptual foundations and the philosophical aspects of renormalization theory
Cao, T. Y., & Schweber, S. S. (1993) · Synthese · doi:10.1007/bf01255832 · Cited by 204
A succession of paradigms in ecology: Essentialism to materialism and probabilism
Simberloff, D. (1980) · Synthese · doi:10.1007/bf00413854 · Cited by 194
Quantitative Geography: Representations, Practices, and Possibilities
Sheppard, E. (2001) · Environment and Planning D: Society and Space · doi:10.1068/d307 · Cited by 182
Hierarchies 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
Wadler, P. (2015) · Communications of the ACM · doi:10.1145/2699407 · Cited by 177
The Cambridge History of Philosophy 1870–1945
(2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041 · Cited by 176
Semantic similarity and machine learning with ontologies
Kulmanov, M., Smaili, F. Z., Gao, X., & Hoehndorf, R. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbaa199 · Cited by 170
“…in which ontologies may be embedded (such as embedding axioms within the natural numbers so that proofs by diagonalization become possible [59, 60]), we are mainly interested in embedding ontologies within real-valued vector spaces so that we can apply modern optimization and machine…”
BackgroundOptimal Ordered Problem Solver
Schmidhuber, J. (2004) · Machine Learning · doi:10.1023/b:mach.0000015880.99707.b2 · Cited by 162
“The primitives of Section A collectively embody a universal programming language, computationally as powerful as the one of G¨odel (1931) or Forth or Ada or C.”
InfluentialThe origins of combinatorics on words
Jean Berstel, A., & Dominique Perrin, A. (2005) · European Journal of Combinatorics · doi:10.1016/j.ejc.2005.07.019 · Cited by 177
Governance and failure: on the limits of sociology
Malpas, J., & Wickham, G. (1995) · The Australian and New Zealand Journal of Sociology · doi:10.1177/144078339503100304 · Cited by 163
Gentzen, G. (1943) · Mathematische Annalen · doi:10.1007/bf01564760 · Cited by 155
Transdisciplinarity at the crossroads
Scholz, R. W., & Steiner, G. (2015) · Sustainability Science · doi:10.1007/s11625-015-0338-0 · Cited by 175
On weak completeness of intuitionistic predicate logic
Kreisel, G. (1962) · Journal of Symbolic Logic · doi:10.2307/2964110 · Cited by 150
Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
Kreisel, G., & Lévy, A. (1968) · Mathematical logic quarterly · doi:10.1002/malq.19680140702 · Cited by 149
Hodges, W. (1983) · Springer eBooks · doi:10.1007/978-94-009-7066-3_1 · Cited by 152
Does Mathematics Need New Axioms?
Feferman, S., Friedman, H., Maddy, P., et al. (2000) · Bulletin of Symbolic Logic · doi:10.2307/420965 · Cited by 142
Schmidhuber, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02565-5_4 · Cited by 171
Volume and value of big healthcare data
Dinov, I. D. (2016) · Journal of Medical Statistics and Informatics · doi:10.7243/2053-7662-4-3 · Cited by 130
“An information-theoretic interpretation of Gödel’s incompleteness principle [ 25 ] suggests the intrinsic limitations of information derived from Big healthcare data.”
Programmability of Chemical Reaction Networks
Cook, M., Soloveichik, D., Winfree, E., & Bruck, J. (2009) · Natural computing series · doi:10.1007/978-3-540-88869-7_27 · Cited by 135
Undecidability and incompleteness in classical mechanics
da Costa, N. C. A., & Dória, F. A. (1991) · International Journal of Theoretical Physics · doi:10.1007/bf00671484 · Cited by 127
Operating system verification—An overview
Klein, G. (2009) · Sadhana · doi:10.1007/s12046-009-0002-4 · Cited by 128
Colbrook, M. J., Antun, V., & Hansen, A. C. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2107151119 · Cited by 240
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
Humankind and the Environment: An Anatomy of Surprise and Ignorance
Faber, M. M., Manstetten, R., & Proops, J. L. R. (1992) · Environmental Values · doi:10.3197/096327192776680089 · Cited by 127
Hierarchies Ontological and Ideological
Linnebo, Ø., & Rayo, A. (2012) · Mind · doi:10.1093/mind/fzs050 · Cited by 120
“Inspired by Hilbert, Gödel suggests introducing infinite types already in his famous incompleteness paper; see Gödel 1931, fn. 48a.”
MethodConstructing free trade: from Manchester boosterism to global management
Sheppard, E. (2005) · Transactions of the Institute of British Geographers · doi:10.1111/j.1475-5661.2005.00158.x · Cited by 118
Schmidhuber, J. (2013) · Frontiers in Psychology · doi:10.3389/fpsyg.2013.00313 · Cited by 175
Artificial Intelligence and Advanced Materials
López, C. (2022) · Advanced Materials · doi:10.1002/adma.202208683 · Cited by 142
Scholz, R. (2017) · Sustainability · doi:10.3390/su9060991 · Cited by 117
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
Sieg, W. (1999) · Bulletin of Symbolic Logic · doi:10.2307/421139 · Cited by 113
A Semiotic Perspective of Mathematical Activity: The Case of Number
Ernest, P. (2006) · Educational Studies in Mathematics · doi:10.1007/s10649-006-6423-7 · Cited by 122
Gödel Machines: Fully Self-referential Optimal Universal Self-improvers
Schmidhuber, J. (2007) · Cognitive Technologies · doi:10.1007/978-3-540-68677-4_7 · Cited by 110
“The fundamental limitations are closely related to those first identified by Gödel’s celebrated paper on self-referential formulae [11].”
BackgroundInfluentialOn the Concept of Following Logically
Tarski, A. (2002) · History and Philosophy of Logic · doi:10.1080/0144534021000036683 · Cited by 110
Hilbert's program relativized; Proof-theoretical and foundational reductions
Feferman, S. (1988) · Journal of Symbolic Logic · doi:10.2307/2274509 · Cited by 109
Understanding Phenomenal Consciousness
Robinson, W. S. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511498886 · Cited by 128
The third AI summer: AAAI Robert S. Engelmore Memorial Lecture
Kautz, H. (2022) · AI Magazine · doi:10.1002/aaai.12036 · Cited by 257
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
Schmidhuber, J. (2002) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054102001291 · Cited by 98
Existential definability in arithmetic
Robinson, J. (1952) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1952-0048374-2 · Cited by 99
Wang, H. H. (1952) · Journal of Symbolic Logic · doi:10.2307/2266241 · Cited by 95
Meta-level programming and knowledge representation
Bowen, K. A. (1985) · New Generation Computing · doi:10.1007/bf03037077 · Cited by 93
PREGEOMETRY: MOTIVATIONS AND PROSPECTS
WHEELER, J. A. (1980) · Elsevier eBooks · doi:10.1016/b978-0-12-473260-5.50005-x · Cited by 99
The Mathematical Development of Set Theory from Cantor to Cohen
Kanamori, A. (1996) · Bulletin of Symbolic Logic · doi:10.2307/421046 · Cited by 91
Toward a Unified Theory of Reading
Sadoski, M., & Paivio, A. (2007) · Scientific Studies of Reading · doi:10.1080/10888430701530714 · Cited by 117
How truthlike can a predicate be? A negative result
McGee, V. (1985) · Journal of Philosophical Logic · doi:10.1007/bf00649483 · Cited by 91
The Road to Modern Logic—An Interpretation
Ferreirós, J. (2001) · Bulletin of Symbolic Logic · doi:10.2307/2687794 · Cited by 91
Software engineering, the software process and their support
Lehman, M. M. (1991) · Software Engineering Journal · doi:10.1049/sej.1991.0028 · Cited by 90
Uher, J. (2014) · Integrative Psychological and Behavioral Science · doi:10.1007/s12124-014-9283-1 · Cited by 93
History of Artificial Intelligence
O’Regan, G. (2016) · Undergraduate topics in computer science · doi:10.1007/978-3-319-33138-6_19 · Cited by 90
Kugel, P. (1977) · Information and Control · doi:10.1016/s0019-9958(77)90175-9 · Cited by 88
Kurt Gödel, 28 April 1906 - 14 January 1978
Kreisel, G. (1980) · Biographical Memoirs of Fellows of the Royal Society · doi:10.1098/rsbm.1980.0005 · Cited by 83
Hilbert's program relativized; Proof-theoretical and foundational reductions
Feferman, S. (1988) · Journal of Symbolic Logic · doi:10.1017/s0022481200028310 · Cited by 83
Kaneko, K., & Ikegami, T. (1992) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(92)90179-q · Cited by 77
Intelligence Explosion: Evidence and Import
Muehlhauser, L., & Salamon, A. (2012) · The frontiers collection · doi:10.1007/978-3-642-32560-1_2 · Cited by 100
Rehk�mper, G., & Zilles, K. (1991) · Cell and Tissue Research · doi:10.1007/bf00318396 · Cited by 89
Turing’s Ideas and Models of Computation
Eberbach, E., Goldin, D., & Wegner, P. W. (2004) · Springer eBooks · doi:10.1007/978-3-662-05642-4_7 · Cited by 100
Metadata
- Authors
- Gödel, K.
- Corresponding author
- Gödel, Kurt
- Venue
- Monatshefte für Mathematik und Physik
- Published
- 1931-12
- Volume
- 38-38
- Issue
- 1
- Pages
- 173-198
- ISSN
- 0026-9255 (ISSN-L)
- 1436-5081
- OpenAlex
- W4256369010
- Cited by
- 2,395
- References
- 1
- Citations by year
- 2026: 129 · 2025: 119 · 2024: 104 · 2023: 81 · 2022: 88 · 2021: 113 · 2020: 80 · 2019: 71 · 2018: 55 · 2017: 66 · 2016: 58 · 2015: 57 · 2014: 64 · 2013: 57 · 2012: 82
- FWCI
- 5.75
- Type
- journal article
- Language
- de
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Monatshefte für Mathematik (publishedVersion)
- 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
- undecidability, Principia Mathematica, formal systems, incompleteness, Gödel's incompleteness theorems, self-reference
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.