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,101–1,200 of 2,380
Krajewski, S. (2004) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2003.11.019 · Cited by 3
Paradoxical Hypnotic Experiences in Escaping Constraining Dilemmas:A Clinical Example
Tschugguel, W., & Hunter, M. E. (2008) · International Journal of Clinical and Experimental Hypnosis · doi:10.1080/00207140802255369 · Cited by 3
Wozu brauchen wir große Kardinalzahlen?
Schindler, R. (2006) · Mathematische Semesterberichte · doi:10.1007/s00591-005-0101-1 · Cited by 3
Murawski, R. (2020) · Studia Humana · doi:10.2478/sh-2020-0025 · Cited by 3
Menger’s Ergebnisse — a biographical introduction
Sigmund, K. (1998) · Springer eBooks · doi:10.1007/978-3-7091-6470-9_2 · Cited by 3
Petkov, P. P. (1987) · Springer eBooks · doi:10.1007/978-1-4613-0897-3_3 · Cited by 3
Sarkar, S. (2001) · doi:10.1002/9780470998656.ch7 · Cited by 3
Obtaining Knowledge of the Subjective Brain (“Epistemics”)
MacLean, P. D. (1992) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0391-9_4 · Cited by 4
Synthetic organisms and self-designing systems
Dress, W. B. (1989) · Telematics and Informatics · doi:10.1016/s0736-5853(89)80026-7 · Cited by 3
Über ω-Unvollständigkeit in der Peano-Arithmetik
Hasenjaeger, G. (1952) · Journal of Symbolic Logic · doi:10.2307/2266239 · Cited by 3
A manifesto for the computational method
Seiden, S. S. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00078-0 · Cited by 3
A Model for the Science of Decision
Bates, J. (1954) · Philosophy of Science · doi:10.1086/287370 · Cited by 3
Recursively invariant β-recursion theory
Maass, W. (1981) · Annals of Mathematical Logic · doi:10.1016/0003-4843(81)90015-2 · Cited by 3
Brand, J. L. (2002) · American Psychologist · doi:10.1037/0003-066x.57.1.66 · Cited by 3
Bulz, N. (2011) · SSRN Electronic Journal · doi:10.2139/ssrn.1743149 · Cited by 3
Pattern classification using teurons
Sipper, M., & Yeshurun, Y. (2002) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1990.118141 · Cited by 3
Computational Complexity Theory
Ogihara, M. (1999) · Wiley Encyclopedia of Electrical and Electronics Engineering · doi:10.1002/047134608x.w1617 · Cited by 3
Beyond Gödel's Theorem: Turing Nonrigidity Revisited
Cooper, S. B. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316716830.006 · Cited by 3
A Contribution Toward Computable Number Theory
Mullin, A. A. (1965) · Mathematical logic quarterly · doi:10.1002/malq.19650110206 · Cited by 3
A problem in recursive function theory
Goodstein, R. L. (1953) · Journal of Symbolic Logic · doi:10.2307/2267405 · Cited by 3
“All the familiar functions of classical number theory, like sum, product, positive difference, exponent of the greatest prime factor, have been shown to be primitive recursive, for instance in Godel [2].”
BackgroundEpistemología y medicina compleja
Gil, M. Á. B. (2005) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Cited by 3
Jacquette, D. (2003) · Springer eBooks · doi:10.1007/0-306-48134-0_1 · Cited by 3
Basin, D., & Matthews, S. (2002) · Springer eBooks · doi:10.1007/978-94-017-0464-9_2 · Cited by 3
Fischer, R. (1967) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.1967.tb54998.x · Cited by 3
SIMONS, P. M. (2009) · Elsevier eBooks · doi:10.1016/b978-0-444-51555-1.50011-0 · Cited by 3
Pfender, M., Reiter, R., & Sartorius, M. (1982) · Lecture notes in mathematics · doi:10.1007/bfb0066903 · Cited by 3
van der Giessen, I. (2022) · Utrecht University Repository (Utrecht University) · doi:10.33540/1486 · Cited by 7
TIJANI, M. A., Kehinde, T. O., Quadri, T., Oyesanmi, F. G., Olalekan, O. T., Habeeb, A. O., Akolawole, I. D., Daniel, O. K., Nkechi, E. B., Glory, S. O., et al. (2024) · OSF Preprints (OSF Preprints) · doi:10.31219/osf.io/wmqet · Cited by 3
Ackermannian Goodstein Sequences of Intermediate Growth
Fernández–Duque, D., & Weiermann, A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-51466-2_14 · Cited by 2
Haas, H. S. (2025) · Jahrbuch Wissenschaftsfreiheit · doi:10.3790/jwf.2025.1453608 · Cited by 2
Computers, meaning, and consciousness
Worden, R. (2025) · Neuroscience of Consciousness · doi:10.1093/nc/niaf057 · Cited by 5
Undecidability in spacetime geometry via the AdS/CFT correspondence
Mir, S. A., Marino, F., Shabir, A., Krauss, L. M., & Faizal, M. (2026) · Physical review. D/Physical review. D. · doi:10.1103/zqgf-6qp7 · Cited by 4
General ontology of substantial laws and their hierarchy in the civilization model
Gribkov, A. A. (2026) · Философская мысль · doi:10.25136/2409-8728.2026.6.80272 · Cited by 2
[Depreciated and replaced by V3] After Turing: The Fold Machine
Smith, M. (2026) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.21512799 · Cited by 2
Proof Theory in Philosophy of Mathematics
Arana, A. (2010) · Philosophy Compass · doi:10.1111/j.1747-9991.2010.00282.x · Cited by 2
Towards a New Agenda for Systems Engineering and International Stability
Bulz, N., Durand, S., Smyth, C. O., & Stapleton, L. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120611-3-ie-4029.00034 · Cited by 2
System and disease: On the fundamental problem of theoretical pathology
Hucklenbroich, P. (1984) · Metamedicine · doi:10.1007/bf00489478 · Cited by 2
Hans Kelsen and normative legal positivism
Paulson, S. L. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.065 · Cited by 1
Chaos in modelling the global climate system
Mihailovic, D., Balaž, I., & Kapor, D. (2016) · Developments in environmental modelling · doi:10.1016/b978-0-444-63918-9.00020-x · Cited by 3
Public and Personal Causations of Creditions
Leach, J. (2017) · New approaches to the scientific study of religion · doi:10.1007/978-3-319-50924-2_29 · Cited by 2
Фрактальний підхід при ідентифікації складних систем
Bolshakov, V. I., Volchuk, V. M., & Dubrov, Y. I. (2017) · Reports of the National Academy of Sciences of Ukraine · doi:10.15407/dopovidi2017.06.046 · Cited by 2
Marciszewski, W. (2019) · Foundations of Computing and Decision Sciences · doi:10.2478/fcds-2019-0002 · Cited by 4
“Before Turing proved in the whole generality the fact of FOL undecidability, Gödel [7] had demonstrated a special case that has an enormous bearings on the progress in mathematics.”
BackgroundWhat one has to know when attacking P vs. NP
Hromkovic̆, J., & Rossmanith, P. (2019) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2019.06.004 · Cited by 2
THE COLLAPSE OF THE HILBERT PROGRAM: A VARIATION ON THE GÖDELIAN THEME
Kripke, S. A. (2022) · Bulletin of Symbolic Logic · doi:10.1017/bsl.2022.14 · Cited by 2
Paradoxes, Intuitionism, and Proof-Theoretic Semantics
Kähle, R., & Santos, P. G. (2024) · Outstanding contributions to logic · doi:10.1007/978-3-031-50981-0_12 · Cited by 2
Exploring Biocomplexity in Cancer: A Comprehensive Review
Szász, A., & Szigeti, G. P. (2024) · Open Journal of Biophysics · doi:10.4236/ojbiphy.2024.142009 · Cited by 3
Rebuilding the Habitable Zone from the Bottom up with Computational Zones
Scharf, C. A., & Witkowski, O. (2024) · Astrobiology · doi:10.1089/ast.2023.0035 · Cited by 6
On Concept Lattices for Numberings
Bazhenov, N. A., Mustafa, M., & Nurakunov, A. M. (2024) · Tsinghua Science & Technology · doi:10.26599/tst.2023.9010102 · Cited by 4
Om teori og praktik i lærerprofessionen og læreruddannelserne i Danmark
Callewaert, S. (2024) · Praxeologi – Et kritisk refleksivt blikk på sosiale praktikker · doi:10.15845/praxeologi.v6.4202 · Cited by 2
Towards a Scalable Proof Engine: A Performant Prototype Rewriting Primitive for Coq
Gross, J., Erbsen, A., Philipoom, J., et al. (2024) · Journal of Automated Reasoning · doi:10.1007/s10817-024-09705-6 · Cited by 2
How to Explain Artificial Intelligence to Humans
Fehlmann, T., & Kranich, E. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-71139-8_4 · Cited by 2
THE VACUITY OF LUDWIG VON MISES’S APRIORISM
Scheall, S. D. (2024) · Journal of the History of Economic Thought · doi:10.1017/s1053837224000178 · Cited by 2
Necessary and unnecessary uncertainty in academic sciences
Arend, R. J. (2024) · Humanities and Social Sciences Communications · doi:10.1057/s41599-024-04152-5 · Cited by 2
Can Formal Logic Make Pure Chance Intelligible? Ladrière on the Eschatological Horizon of Reason
Bergier, H. (2025) · Logica Universalis · doi:10.1007/s11787-025-00368-4 · Cited by 2
Samarawickrama, M. (2025) · Journal of Physics Conference Series · doi:10.1088/1742-6596/3027/1/012014 · Cited by 2
“In contrast, Richard Swinburne [7] argues causation is a fundamental of reality.”
SAT requires exhaustive search
Xu, K., & Zhou, G. (2025) · Frontiers of Computer Science · doi:10.1007/s11704-025-50231-4 · Cited by 2
Mundici, D., & Sieg, W. (2017) · Boston studies in the philosophy of science · doi:10.1007/978-3-319-53280-6_2 · Cited by 2
Rasga, J., Sernadas, C., & Sernadas, A. (2014) · Studies in universal logic · doi:10.1007/978-3-319-10193-4_20 · Cited by 2
The Revolution of János Bolyai
Prékopa, A. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-29555-0_1 · Cited by 2
From intuitionism to emotivism
Dancy, J. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.061 · Cited by 5
Mozart — oder unser Unvermögen, das Genie zu begreifen
Eigen, M. (2000) · Heidelberger Jahrbücher · doi:10.1007/978-3-642-87237-2_3 · Cited by 2
The Philosophical Impact of the Löwenheim-Skolem Theorem
Arsenijević, M. (2011) · Springer eBooks · doi:10.1007/978-94-007-2390-0_4 · Cited by 2
Natural Language Processing Methods for Extracting Information from Mathematical Texts
Natho, N., Jeschke, S., Pfeiffer, O., et al. (2008) · Lecture notes in electrical engineering · doi:10.1007/978-0-387-74938-9_21 · Cited by 2
Numerical Integration of PDEs for Safety Critical Applications Implemented by I&C Systems
Vollmer, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30138-7_23 · Cited by 2
Metamathematische Aspekte der Hausdorffschen Mengenlehre
Koepke, P. (1996) · Vieweg+Teubner eBooks · doi:10.1007/978-3-322-80276-7_4 · Cited by 2
Introduction: The Three Foundational Programmes
Lindström, S., & Palmgren, E. (2008) · Synthese Library/Synthese library · doi:10.1007/978-1-4020-8926-8_1 · Cited by 2
Transmathematical Basis of Infinitely Scalable Pipeline Machines
Anderson, J. A. D. W. (2015) · Procedia Computer Science · doi:10.1016/j.procs.2015.05.408 · Cited by 4
Towards a generic view of primality through multiset decompositions of natural numbers
Tarau, P. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.04.025 · Cited by 2
Computability of entropy and information in classical Hamiltonian systems
Kim, S. (2009) · Physics Letters A · doi:10.1016/j.physleta.2009.02.050 · Cited by 2
Editor’s Introduction to Jean van Heijenoort, Historical Development of Modern Logic
Anellis, I. H. (2012) · Logica Universalis · doi:10.1007/s11787-012-0063-8 · Cited by 2
Gaspar, Y., & Acquaviva, G. (2012) · The European Physical Journal Plus · doi:10.1140/epjp/i2012-12065-3 · Cited by 2
Malament–Hogarth Machines and Tait’s Axiomatic Conception of Mathematics
Berry, S. E. (2013) · Erkenntnis · doi:10.1007/s10670-013-9571-z · Cited by 2
REMARKS ON THEORIES OF COMPUTATION AND SEMANTICS OF PROGRAMMING LANGUAGES
Ghose, A. (1978) · Kybernetes · doi:10.1108/eb005495 · Cited by 2
Modèles et management : le cycle CDEPM de construction et d'évaluation de la connaissance
Magne, L. (2011) · Management & Avenir · doi:10.3917/mav.043.0428 · Cited by 2
G�del, Penrose and the possibility of AI
Dodd, T. (1991) · Artificial Intelligence Review · doi:10.1007/bf00143761 · Cited by 2
Strategic use of the unsayable: Paradox as argument in Gödel's theorem
Cyphert, D. (1998) · Quarterly Journal of Speech · doi:10.1080/00335639809384205 · Cited by 4
Model Theories of Set Theories and Type Theory
Jones, R. M. (2014) · Open Journal of Philosophy · doi:10.4236/ojpp.2014.41008 · Cited by 2
PPS: Privacy-preserving statistics using RFID tags
Blaß, E.-O., Elkhiyaoui, K., & Molva, R. A. (2012) · IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) · doi:10.1109/wowmom.2012.6263773 · Cited by 2
Concise survey of mathematical logic
Stillwell, J. (1977) · Journal of the Australian Mathematical Society · doi:10.1017/s1446788700020164 · Cited by 3
“…O, namely Tr^(5 160 John Stillwell [22] As we argued in the case of predicate logic, an algorithm for deciding truth of, formulas in number theory would yield one for the M on rAn halting problem, 5 hence no such algorithm exists—number theory is undecidable (essentially due to ̂ Godel, 1931).”
BackgroundInfluentialClassical Logic's Coming of Age
Dawson, J. W. (2007) · Elsevier eBooks · doi:10.1016/b978-044451541-4/50016-6 · Cited by 3
Vertrauen im Internet: Wie sicher soll E-Commerce sein?
Grimm, R. (2001) · Xpert.press · doi:10.1007/978-3-642-56684-4_5 · Cited by 2
Semantics of language for ecosystems modelling: A model case
Usó-Doménech, J. L., Nescolarde‐Selva, J. A., Lloret‐Climent, M., & Gash, H. (2016) · Ecological Modelling · doi:10.1016/j.ecolmodel.2016.02.012 · Cited by 2
Why Turing’s Thesis Is Not a Thesis
Soare, R. I. (2015) · Springer eBooks · doi:10.1007/978-3-319-22156-4_12 · Cited by 3
Transaction Cost Economics Applied to IT Outsourcing: Findings and Critique
Lacity, M. C., & Willcocks, L. P. (2009) · Palgrave Macmillan UK eBooks · doi:10.1057/9780230594838_2 · Cited by 2
Kripke, S. A. (2014) · Palgrave Macmillan UK eBooks · doi:10.1057/9781137400932_11 · Cited by 2
Philosophy and the first world war
Baldwin, T. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.030 · Cited by 3
Idealism in Britain and the United States
Allard, J. W. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.005 · Cited by 4
Meaning, Rigidity, and Modality
Shieh, S. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0019 · Cited by 2
The rise of social anthropology
Salmon, M. H. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.059 · Cited by 2
Is cognitive science a science at all?
Suwara, M., & Płazowski, J. W. (2012) · IEEE International Conference on Cognitive Infocommunications · doi:10.1109/coginfocom.2012.6421948 · Cited by 2
“[1] Gödel Kurt, "Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, I.”
BackgroundOn the justification of deduction and induction
Huber, F. (2017) · European Journal for Philosophy of Science · doi:10.1007/s13194-017-0177-1 · Cited by 2
Concrete Mathematics. Finitistic Approach to Foundations
Mostowski, M., & Czarnecki, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-662-55386-2_19 · Cited by 2
Covariant electromagnetic field lines
Hadad, Y., Cohen, E., Kaminer, I. E., et al. (2017) · Journal of Physics Conference Series · doi:10.1088/1742-6596/880/1/012052 · Cited by 2
Pure Σ2-elementarity beyond the core
Wilken, G. (2021) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2021.103001 · Cited by 2
The modernity of Dedekind’s anticipations contained in What are numbers and what are they good for?
Vidal, J. C., & Tur, J. S. (2018) · Archive for History of Exact Sciences · doi:10.1007/s00407-018-0202-6 · Cited by 2
Agent-based Turing Complete Transactions integrating feedback within a Blockchain System
Wright, C. (2019) · International Multi-Conference on Systems, Signals & Devices (SSD) · doi:10.1109/ssd.2019.8893185 · Cited by 2
Asymptotic Quasi-completeness and ZFC
Džamonja, M., & Panza, M. (2018) · Trends in logic · doi:10.1007/978-3-319-98797-2_8 · Cited by 2
“Cohen’s result came many years after Gödel’s incompleteness theorems ([19]), which imply”
BackgroundWheatman, M. (2018) · International Journal of Conceptual Structures and Smart Applications · doi:10.4018/ijcssa.2018070101 · Cited by 2
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.