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
Items 1,501–1,600 of 2,380
The responsibility of the social worker: ethical implications of theory and practice
Kersting, H. J. (2005) · Kybernetes · doi:10.1108/03684920510581594 · Cited by 1
The logical meaning of programs of a subrecursive language
Coy, W. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90025-9 · Cited by 1
G�del-Theorem und Kuhlenbeck-Paradox
Gerlach, J. (1988) · Die Naturwissenschaften · doi:10.1007/bf00377815 · Cited by 1
Philosophy, Semantics and Cybernetics
George, F. H. (1991) · Kybernetes · doi:10.1108/eb005902 · Cited by 1
On the Antinomy of the Liar and the Semantics of Natural Language
Suszko, R. (1979) · Springer eBooks · doi:10.1007/978-94-009-9777-6_24 · Cited by 1
On a class of independent problems related to Rice theorem
Calude, C. S. (1983) · ACM SIGACT News · doi:10.1145/1008923.1008926 · Cited by 1
Makous, W. L. (2000) · Science · doi:10.1126/science.287.5457.1399b · Cited by 1
Antonelli, G. A. (1996) · Synthese · doi:10.1007/bf00413605 · Cited by 1
Villacampa, Y., Castro, M. Á., Uso-Domenech, J. L., et al. (2002) · Cybernetics & Systems · doi:10.1080/019697202753551602 · Cited by 1
Epistemología y medicina compleja
Gil, M. Á. B. (2005) · Texto & Contexto - Enfermagem · doi:10.1590/s0104-07072005000300007 · Cited by 1
Myhill, J. R. (1949) · Journal of Symbolic Logic · doi:10.2307/2267047 · Cited by 1
A functional approach to pattern recognition theory
Huang, J. K. (2006) · IEEE International Conference on Granular Computing (GrC) · doi:10.1109/grc.2006.1635898 · Cited by 1
Relativity phenomena in set theory
�berg, C. (1974) · Synthese · doi:10.1007/bf00660895 · Cited by 1
A personal account of Turing’s imprint on the development of computer science
Díaz, J., & Torras, C. (2012) · Computer Science Review · doi:10.1016/j.cosrev.2012.11.001 · Cited by 3
Real-World Limits to Algorithmic Intelligence
Pape, L., & Kok, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22887-2_49 · Cited by 1
Guest Editor’s Introduction: JvH100
Anellis, I. H. (2012) · Logica Universalis · doi:10.1007/s11787-012-0068-3 · Cited by 1
Smullyan, R. M. (1985) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70144-7 · Cited by 1
The Natural Numbers as a Universal Library
Mosterín, J. (1997) · Springer eBooks · doi:10.1007/978-94-011-5690-5_18 · Cited by 1
Modal Logics II: Toward a Formal Analysis of Cultural Objects
Anderson, A. R., & Moore, O. K. (1963) · Boston studies in the philosophy of science · doi:10.1007/978-94-010-3263-6_10 · Cited by 1
Definition eines (relativ vollständigen) formalen Systems konstruktiver Arithmetik
Wette, E. (1969) · Springer eBooks · doi:10.1007/978-3-642-86745-3_9 · Cited by 1
Hallett, M. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.012 · Cited by 5
Epistemology and Science in the Image of Modern Philosophy: Rorty on Descartes and Locke
Hatfield, G. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0020 · Cited by 1
The Cognitive Basis of Systems Integration
Paoli, M. (2005) · doi:10.1093/acprof:oso/9780199263233.003.0009 · Cited by 1
Sure Path of a Science: Kant in the Analytic Tradition
Neiman, S. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0014 · Cited by 1
Hodges, A. (1994) · Computerkultur · doi:10.1007/978-3-7091-9381-5_2 · Cited by 1
Zur Soziologie der Formalen Logik
Baldamus, W. (1981) · VS Verlag für Sozialwissenschaften eBooks · doi:10.1007/978-3-322-83596-3_25 · Cited by 1
The diagonal argument—A study of cases
Šikić, Z. (1992) · International Studies in the Philosophy of Science · doi:10.1080/02698599208573430 · Cited by 1
Resolution theorem proving: a logical point of view
Leitsch, A. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316755860.002 · Cited by 1
Borceux, F. (2013) · Springer eBooks · doi:10.1007/978-3-319-01730-3_7 · Cited by 1
Use of Mathematical Logical Concepts in Quantum Mechanics: An ExamplePreprint
Benioff, P. A. (2001) · Cited by 1
No system can be improved in all respects
Marcus, S. (1998) · De Gruyter eBooks · doi:10.1515/9783110801194.143 · Cited by 1
Harel, D., & Feldman, Y. (2008) · Unitext · doi:10.1007/978-88-470-0580-8_18 · Cited by 1
Human–Machine Interaction and Visual Data Mining
Upasana, S., Gupta, A., Khan, S., et al. (2022) · doi:10.1002/9781119792529.ch12 · Cited by 1
Barthes meets Benjamin? A Relating of their Views on the Conjunction between Language and Literature
Thobo-Carlsen, J. (1998) · Orbis Litterarum · doi:10.1111/j.1600-0730.1998.tb00099.x · Cited by 1
(1997) · Annals of Science · doi:10.1080/00033799700200311 · Cited by 1
Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflection
Hickey, J. J., Nogin, A., Yu, X. F., et al. (2006) · ACM SIGPLAN Notices · doi:10.1145/1160074.1159826 · Cited by 1
Vigo, R. (2018) · Cognitive Systems Research · doi:10.1016/j.cogsys.2018.04.007 · Cited by 1
Potter, M. (2004) · doi:10.1093/acprof:oso/9780199269730.003.0009 · Cited by 1
Edmonds, B. (2017) · Wiley eBooks · doi:10.1002/9781118974414.ch3 · Cited by 1
Crossley, J. N. (2006) · Springer eBooks · doi:10.1007/0-387-31072-x_5 · Cited by 1
Macintyre, A. J. (1981) · Springer eBooks · doi:10.1007/978-94-009-9056-2_4 · Cited by 1
There Is A Set of All Truths: A Reply to Patrick Grim.Preprint
Blaber, R. M. (2023) · doi:10.31235/osf.io/pj7xm · Cited by 1
Greenspan, N. S., & Han, O. (2023) · Qeios · doi:10.32388/545bgm · Cited by 2
Integration-Ingression System of Medical EducationPreprint
Revo, V. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5150545 · Cited by 1
Incompleteness and Undecidability
Rautenberg, W. (2009) · Springer eBooks · doi:10.1007/978-1-4419-1221-3_6 · Cited by 1
Platzer, A. (2010) · Springer eBooks · doi:10.1007/978-3-642-14509-4_2 · Cited by 1
Structures et aléa en finance, une approche par la complexité algorithmique de l’information
Ma, L. (2010) · theses.fr (ABES) · doi:10.70675/a6611819z5aefz4ab0z87e3z22f17b7b4a81 · Cited by 1
Automated reasoning on trees with cardinality constraints
Patino, I. B. (2011) · theses.fr (ABES) · doi:10.70675/0403fec7z6d88z4f5czb5d8z53294519fb37 · Cited by 1
“consistency of arithmetic using the theory of arithmetic itself [Gödel, 1931].”
MethodDaudt, R. C. (2020) · theses.fr (ABES) · doi:10.70675/cf613c02zcc46z484az9776z2d118b4d58a9 · Cited by 3
Встроенный наблюдатель и границы самопознания: квантовая теорема и трансцендентальная эпистемологияPreprint
Materov (2026) · doi:10.24108/preprints-3116125 · Cited by 1
Chapter 11 A bibliography of recursive algebra and recursive model theory
Kalantari, I. (1998) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(98)80012-8 · Cited by 1
Assessing Artificial Intelligence: A Critique of Pure Computationalism
Tekinerdogan, B. (2024) · doi:10.31219/osf.io/cdw79 · Cited by 1
On Rudimentarity, Primitive Recursivity and Representability
Salehi, S. (2020) · Reports on Mathematical Logic · doi:10.4467/20842589rm.20.004.12436
“Primitive recursive functions are what were called “rekursiv” by Kurt Gödel in his seminal 1931 paper [6, 7] where he proved the celebrated incompleteness theorem.”
BackgroundWierzbicki, A. P. (2014) · Intelligent systems reference library · doi:10.1007/978-3-319-09033-7_6
Dubislav and Classical Monadic Quantificational Logic
Thiel, C. (2013) · Boston studies in the philosophy of science · doi:10.1007/978-94-007-5485-0_8
Juhos, B. (1976) · Springer eBooks · doi:10.1007/978-94-010-1488-5_12
System Surfaces: There Is Never Just Only One Structure
Kornwachs, K. (2013) · Springer eBooks · doi:10.1007/978-3-642-34997-3_3
The Warsaw School, Widening Applications, Models of Set Theory (1918–1940)
Moore, G. M. (1982) · Studies in the history of mathematics and physical sciences · doi:10.1007/978-1-4613-9478-5_5
Reactions to the Discovery of the Incompleteness Phenomenon
Murawski, R. (2003) · Springer eBooks · doi:10.1007/978-94-017-0249-2_15
Use of a computer for analytic transformations on polynomials
Blagoveshchenskii, Y. V., & Progrebinskii, S. B. (1971) · Cybernetics · doi:10.1007/bf01071800
Ein neuer “Strukturtyp” von Logikbuch?
Nortmann, U. (1987) · Erkenntnis · doi:10.1007/bf00697673
Quantum and Classical Gödelian Indeterminism, Measurement, and Informational Collapse into the Past
Orlov, Y. F. (1999) · Springer eBooks · doi:10.1007/978-94-017-1454-9_6
The Concept of ‘Simplicity’ in the Physico-Mathematical Sciences
Kolman, A. (1974) · Boston studies in the philosophy of science · doi:10.1007/978-94-010-2115-9_30
Komplexitätstheoretische Ableitung eines integrierten Komplexitätsmanagements
Bliss, C. (2000) · Gabler Verlag eBooks · doi:10.1007/978-3-663-10720-0_3
Bulz, N. (2013) · SSRN Electronic Journal · doi:10.2139/ssrn.2326755
Ingegnoli, V. (2014) · Springer eBooks · doi:10.1007/978-88-470-5226-0_15
The Structures of Recursion Theory
(1983) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70956-x
Einleitung: Bio-Psycho-Soziale Medizin
Ehlers, W., Traue, H. C., & Czogalik, D. (1988) · PSZ-Drucke · doi:10.1007/978-3-642-73459-5_1
Markowitz, H. M. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139629096.022
Closer Links Between Population Sciences and Probability
Courgeau, D. (2012) · Springer eBooks · doi:10.1007/978-94-007-2879-0_6
Changing the Paradigm: Towards Computation with Molecules
Szacilowski, K. T. (2012) · Wiley eBooks · doi:10.1002/9780470710883.ch3
Einführende Betrachtungen über Algorithmen
Hermes, H. (1978) · Heidelberger Taschenbücher · doi:10.1007/978-3-642-95327-9_1
Introductory Reflections on Algorithms
Hermes, H. (1965) · Springer eBooks · doi:10.1007/978-3-662-11686-9_1
Cantor Diagrams: A Unifying Discussion of Self-Reference
Germano, G., & Mazzanti, S. (2003) · Applied Categorical Structures · doi:10.1023/a:1024447013739
Ammon, K. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052112
Rethinking the Scientific Enterprise: In Defense of Reductionism
Durham, I. T. (2015) · The frontiers collection · doi:10.1007/978-3-319-13045-3_18
On the Theory of Self-Reference
Rautenberg, W. (2009) · Springer eBooks · doi:10.1007/978-1-4419-1221-3_7
Artificial Intelligence, G ödelian Arguments Against
Slezak, P. P. (2005) · Encyclopedia of Cognitive Science · doi:10.1002/0470018860.s00158
The 2001 Southam Lecture: Reflections on Harold Innis's "Minerva's Owl"
Taylor, J. R. (2001) · Canadian Journal of Communication · doi:10.22230/cjc.2001v26n3a1232
Alan Turing: ¿personaje del siglo XX?
Ron, J. M. S. (2013) · Arbor · doi:10.3989/arbor.2013.764n6008 · Cited by 1
Déterminismes et complexités : du physique à l'éthique
Goles, E. (2008) · La Découverte eBooks · doi:10.3917/dec.bourg.2008.01.0077
Mereological Theories of Concepts in Granular Computing
Polkowski, L. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87563-5_3
A note on the automatic generation of inductive assertions
Coy, W. (1976) · Lecture notes in computer science · doi:10.1007/3-540-07854-1_181
A remark on Gödel’s incompleteness theorems
Loinger, A. (1993) · Il Nuovo cimento della Società italiana di fisica. B/Il Nuovo cimento B · doi:10.1007/bf02827000
FUCHINO, S. (2013) · Journal of the Japan Association for Philosophy of Science · doi:10.4288/kisoron.41.1_63
Fundamentals of Medical Concept Formation
Sadegh-Zadeh, K. (2011) · Philosophy and medicine · doi:10.1007/978-94-007-2260-6_5
Mustakova‐Possardt, E., & Basseches, M. (2013) · Springer eBooks · doi:10.1007/978-1-4614-7391-6_11
Courgeau, D. (2012) · Springer eBooks · doi:10.1007/978-94-007-2879-0_4
Perspectives on Economic and Ecologic Evolution
Rosser, J. B. (2011) · Springer eBooks · doi:10.1007/978-1-4419-8828-7_6
On the intellectual terrain around NP
Hartmanis, J., & Chari, S. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57811-0_1
Why We Shouldn’t Reason Classically, and the Implications for Artificial Intelligence
Campbell, D. I. (2015) · Synthese Library/Synthese library · doi:10.1007/978-3-319-23291-1_10
Complexity of sequence encodings
Horváth, S. (1977) · Lecture notes in computer science · doi:10.1007/3-540-08442-8_108
The Epistemic Approach: Logicist Interpretation
Courgeau, D. (2012) · Springer eBooks · doi:10.1007/978-94-007-2879-0_3
Die Methode der Extension und Intension
Carnap, R. (1972) · LEP. Library of exact philosophy · doi:10.1007/978-3-7091-8281-9_1
Robinson, W. S. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511498886.007
“The claim of noncomputability of consciousness is based on the arguments of Penrose (1989, 1994), which claim to derive their conclusions from the incompleteness of arithmetic established by Gödel (1931). In”
Prolegomena Zu Einer Protophysik Als Strenger Wissenschaft
Einstein, A. (1971) · Springer eBooks · doi:10.1007/978-94-010-3022-9_1
Impossibility theorems and health care systems
Penchas, S. (2002) · Transplantation Proceedings · doi:10.1016/s0041-1345(02)02834-8
The programming language MINO and its formal definition
Cooke, J., & Al-Noufaly, M. H. J. (1984) · ACM SIGPLAN Notices · doi:10.1145/948566.948569
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.