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,201–1,300 of 2,380
Lesson Three: A Brief History of Geographic Thought
Ahamer, G. (2019) · Springer eBooks · doi:10.1007/978-3-319-51704-9_12 · Cited by 2
Rose, A. (1981) · Springer eBooks · doi:10.1007/978-94-009-9056-2_7 · Cited by 2
Contrasts Between Adaptive and Deterministic Models
Ursegov, S., & Zakharian, A. (2021) · Advances in oil and gas exploration & production · doi:10.1007/978-3-030-67474-8_3 · Cited by 2
AN ESCAPE FROM VARDANYAN’S THEOREM
Borges, A. D. A., & Joosten, J. J. (2022) · Journal of Symbolic Logic · doi:10.1017/jsl.2022.38 · Cited by 2
God, the beautiful and mathematics: A response
Smit, P., & de Heide, R. (2021) · HTS Teologiese Studies / Theological Studies · doi:10.4102/hts.v77i4.6208 · Cited by 2
“…with working with formal systems as a foundation for (the method of) mathematics, the following famous theorems of the mathematician and philosopher Gödel (1931) might come as a disappointment: When F is a consistent formal system (sufficiently rich, see Shapiro 2000 Ch.6.4), (1) there are…”
MethodInfluentialOn Measure Quantifiers in First-Order Arithmetic
Antonelli, M., Lago, U. D., & Pistone, P. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-80049-9_2 · Cited by 2
Razvijanje družinske pismenosti in medkulturnih odnosov ob kuharskih knjigah za (predšolske) otroke
Jakše, K. J., & Haramija, D. (2021) · University of Maribor, University Press eBooks · doi:10.18690/978-961-286-488-0.16 · Cited by 2
Undecidability, incompleteness, and completeness of second-order logic in Coq
Koch, M. E., & Kirst, D. (2022) · ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP) · doi:10.1145/3497775.3503684 · Cited by 2
McLaughlin, B. P. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.054 · Cited by 5
Leahey, T. H. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.056 · Cited by 2
The Common Logic of Quantum Universe—Part I: The Case of Non-relativistic Quantum Mechanics
Tessarotto, M., & Cremaschini, C. (2022) · Foundations of Physics · doi:10.1007/s10701-022-00547-z · Cited by 4
“, in the sense that it is not possible to establish whether they are true or false [18].”
BackgroundDouglas Hofstadter’s Gödelian Philosophy of Mind
Nenu, T. (2022) · Journal of Artificial Intelligence and Consciousness · doi:10.1142/s2705078522500011 · Cited by 3
Did Turing Stand on Gödel’s Shoulders?
Copeland, B. J., & Fan, Z. (2022) · The Mathematical Intelligencer · doi:10.1007/s00283-022-10177-y · Cited by 2
Gödel’s First Incompleteness Theorem via the Halting Problem
Tourlakis, G. (2021) · Computability · doi:10.1007/978-3-030-83202-5_8 · Cited by 2
Turnstile Figures of Opposition
Béziau, J.-Y. (2022) · Studies in universal logic · doi:10.1007/978-3-030-90823-2_10 · Cited by 2
Aboites, V. (2022) · Open Journal of Philosophy · doi:10.4236/ojpp.2022.123032 · Cited by 2
Von Neumann, Turing a Gödel: o mysli a strojích
Jurková, B., & Zámečník, L. (2022) · Teorie vědy / Theory of Science · doi:10.46938/tv.2022.556 · Cited by 2
Blending Theory and Mathematical Cognition
Danesi, M. (2022) · Springer eBooks · doi:10.1007/978-3-031-03945-4_50 · Cited by 2
Waliszewski, P. (2023) · Journal of Biomedical Research & Environmental Sciences · doi:10.37871/jbres1798 · Cited by 2
Narkiewicz, W. (2011) · Springer monographs in mathematics · doi:10.1007/978-0-85729-532-3_6 · Cited by 2
Goos, G., & Syrbe, M. (2008) · Springer eBooks · doi:10.1007/978-3-540-76550-9_5 · Cited by 2
Alan Turing y los orígenes de la complejidad
Martin-Delgado, M. A. (2013) · Arbor · doi:10.3989/arbor.2013.764n6006 · Cited by 2
Lori, N. F., & Blin, A. H. (2010) · Foundations of Science · doi:10.1007/s10699-010-9174-y · Cited by 5
Zermelo in the mirror of the Baer correspondence, 1930–1931
Ebbinghaus, H.-D. (2003) · Historia Mathematica · doi:10.1016/j.hm.2003.08.002 · Cited by 3
Džamonja, M. (2006) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2006.1896 · Cited by 2
On Form, Formalism and Equivalence
Wallen, L. A. (1990) · Springer eBooks · doi:10.1007/978-1-4612-4476-9_51 · Cited by 2
Schmidhuber, J. (2012) · Science · doi:10.1126/science.336.6089.1638-c · Cited by 2
Mathematics in Engineering and Science
Pedersen, S. A. (2016) · Trends in the history of science · doi:10.1007/978-3-319-31502-7_4 · Cited by 2
In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming
BRY, F. (2019) · Theory and Practice of Logic Programming · doi:10.1017/s1471068419000024 · Cited by 3
A domain-specific language for filtering in application-level gateways
Balldin, H., & Reichenbach, C. (2020) · ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences (GPCE) · doi:10.1145/3425898.3426955 · Cited by 3
Minds and Robots: An Impassable Border
Zizzi, P., & Pregnolato, M. (2021) · Contemporary systems thinking · doi:10.1007/978-3-030-71877-0_15 · Cited by 2
The Π21$\Pi ^1_2$ consequences of a theory
Aguilera, J. P., & Pakhomov, F. N. (2022) · Journal of the London Mathematical Society · doi:10.1112/jlms.12707 · Cited by 2
Mathematical Theory of Serial Computers
Čulík, K. (1976) · Informatik-Fachberichte · doi:10.1007/978-3-642-66319-2_20 · Cited by 2
Logical Foundations for the Infrastructure of the Information Market
Heather, M., Livingstone, D., & Rossiter, N. (2008) · Springer eBooks · doi:10.1007/978-1-84800-221-0_49 · Cited by 2
“This can also be explained by Gödel’s theory of undecidability which is perhaps even better known [10].”
BackgroundOn Quantifying the Effects of Formal and Final Causes in Ecosystem Development
Ulanowicz, R. E., & Goldman, A. J. (1988) · Research reports in physics · doi:10.1007/978-3-642-73953-8_16 · Cited by 2
Alfred Tarski (1901–1983), Alonzo Church (1903–1995), and Kurt Gödel (1906–1978)
Anderson, C. A. (2001) · doi:10.1002/9780470998656.ch10 · Cited by 2
Software uncertainty and the role of CASE in its minimisation and control
Lehman, M. M. (2002) · doi:10.1109/jcit.1990.128290 · Cited by 2
Critical remarks about a paper on limitations for artificial intelligence
Konrad, E. (1978) · ACM SIGART Bulletin · doi:10.1145/1045443.1045444 · Cited by 2
Lambek, J. (1997) · Bulletin of Symbolic Logic · doi:10.2307/421147 · Cited by 2
Constructive chaos by cellular automata and possible sources of an arrow of time
Svozil, K. (1990) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(90)90199-y · Cited by 2
Communication and computability: The case of Alan Mathison Turing
Chesebro, J. W. (1993) · Communication Quarterly · doi:10.1080/01463379309369870 · Cited by 2
Smullyan, R. M. (1985) · Studia Logica · doi:10.1007/bf00370432 · Cited by 2
Electronic life and synthetic intelligent systems
Dress, W. B. (1990) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(90)90335-h · Cited by 2
Newtons Optik als unvollendetes quantenphysikalisches Konzept
Bopp, F. (1984) · Physikalische Blätter · doi:10.1002/phbl.19840400906 · Cited by 2
Measurement of a quantum ensemble by a classical apparatus
Peres, A., & Rosen, N. (1964) · Annals of Physics · doi:10.1016/0003-4916(64)90003-x · Cited by 2
Fallacy of formal discourse analysis
Pak, T. (1971) · Lingua · doi:10.1016/0024-3841(71)90048-9 · Cited by 2
Does the Methodology of Teaching Thermodynamics to Engineers Need Changing for the 1990s?
Mayhew, Y. (1991) · Proceedings of the Institution of Mechanical Engineers Part A Journal of Power and Energy · doi:10.1243/pime_proc_1991_205_038_02 · Cited by 2
Representing knowledge with theories about theories
Stabler, E. P. (1990) · The Journal of Logic Programming · doi:10.1016/0743-1066(90)90035-4 · Cited by 2
Consistency, Turing Computability and Gödel’s First Incompleteness Theorem
Hadley, R. F. (2007) · Minds and Machines · doi:10.1007/s11023-007-9082-2 · Cited by 2
Wette, E. (1970) · dialectica · doi:10.1111/j.1746-8361.1970.tb01221.x · Cited by 2
DECIDING SOME UNDECIDABLE TOPOLOGICAL STATEMENTS*
Comfort, W. W. (1979) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.1979.tb14105.x · Cited by 2
Gödel, Kaplow, Shavell: Consistency and Completeness in Social DecisionmakingPreprint
Dari‐Mattiacci, G. (2003) · SSRN Electronic Journal · doi:10.2139/ssrn.470122 · Cited by 2
The theory of logical types - a cul-de-sac in communication theory
Gundersen, J. H. R. (1988) · Nordic Journal of Psychiatry · doi:10.3109/08039488809094945 · Cited by 2
The Gödel Incompleteness Theorem from a Length-of-Proof Perspective
Dawson, J. W. (1979) · American Mathematical Monthly · doi:10.1080/00029890.1979.11994901 · Cited by 2
The renaissance of epistemology
Floridi, L. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.045 · Cited by 2
The Psychological Scaffolding of ArithmeticPreprint
Grice, M., Kemp, S., Morton, N. J., et al. (2020) · doi:10.31234/osf.io/myq4n · Cited by 2
Testing quantum theory with thought experiments
Nurgalieva, N., & Renner, R. (2021) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000475588 · Cited by 3
Floyd, J., & Shieh, S. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0001 · Cited by 2
Nerode, A. (1986) · Springer eBooks · doi:10.1007/978-1-4612-4984-9_10 · Cited by 2
Lamprecht, F. (1983) · Springer eBooks · doi:10.1007/978-3-642-68883-6_14 · Cited by 2
Measuring Complexity using InformationPreprint
Jaffé, K. (2024) · Qeios · doi:10.32388/qng11k · Cited by 2
Penchev, V. D. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5278320 · Cited by 2
The Non-Constructibility of Global Unity from Internal Observables: A Cross-Domain Limit TheoremPreprint
Riaz, A. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5331840 · Cited by 2
Commentary: Sustainable Development — Teleology and Ambiguity
Wenzel, V. (1998) · Springer eBooks · doi:10.1007/978-3-642-52354-0_4 · Cited by 2
Quantum Mechanics Versus a Method of Relativized Conceptualization
Mugur-Schächter, M. (2003) · Springer eBooks · doi:10.1007/0-306-48144-8_7 · Cited by 3
Self-Reference, Chaos, and Fuzzy Logic
Grim, P. (2006) · Springer eBooks · doi:10.1007/3-540-32502-6_12 · Cited by 2
On Self-Reference and Self-Description
Svozil, K. (1999) · Springer eBooks · doi:10.1007/978-94-015-9620-6_12 · Cited by 3
Mathematics: A Pointer to an Independent Reality
Schins, J. M. (1997) · Springer eBooks · doi:10.1007/978-94-011-5428-4_5 · Cited by 2
Sano, K., & Sugimoto, M. (2017) · Advanced information and knowledge processing · doi:10.1007/978-3-319-59090-5_6 · Cited by 1
The East, the West and the universal machine
Marchal, B. (2017) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2017.08.017 · Cited by 1
Some Historical and Philosophical Remarks on the Rule of Law in the Time of Automation
Lassègue, J. (2020) · Springer eBooks · doi:10.1007/978-3-030-52722-8_4 · Cited by 1
Distilling the Requirements of Gödel’s Incompleteness Theorems with a Proof Assistant
Popescu, A., & Traytel, D. (2021) · Journal of Automated Reasoning · doi:10.1007/s10817-021-09599-8 · Cited by 1
Fu, Y. (2021) · Theoretical Computer Science · doi:10.1016/j.tcs.2021.10.001 · Cited by 1
Mathematical Modeling Using Algebraically Oriented Languages
Andrei, N. (2013) · Springer optimization and its applications · doi:10.1007/978-1-4614-6797-7_1 · Cited by 1
Tumulka, R. (2022) · Lecture notes in physics · doi:10.1007/978-3-031-09548-1_3 · Cited by 1
The Riemann Hypothesis As the Parity of Special Binomial Coefficients
Matiyasevich, Y. V. (2022) · Doklady Mathematics · doi:10.1134/s1064562422700247 · Cited by 1
The Integral Nature of the Scientific Enterprise
Jeynes, C., & Parker, M. C. (2026) · Filozoficzne Aspekty Genezy · doi:10.53763/fag.2026.23.1.258 · Cited by 1
Andersen, F. J. (2024) · Episteme · doi:10.1017/epi.2024.25 · Cited by 1
Mathematicians as Researchers and Their Representation in the Movies
Alcolea-Banegas, J. (2025) · Springer eBooks · doi:10.1007/978-3-031-68989-5_7 · Cited by 1
G¨odel Limits and Prime-Lattice Quantum Logic within the Universal Model Framework
Gericke, M. (2025) · IPI Letters · doi:10.59973/ipil.201 · Cited by 1
The Theory of Observational Relativity Serial Report 1: A New Theory with Significant Discoveries
Ruan, X. (2025) · F1000Research · doi:10.12688/f1000research.165017.1 · Cited by 1
Is the Universe a Material System?
Romero, G. E. (2025) · Foundations of Science · doi:10.1007/s10699-025-10004-5 · Cited by 1
Completing Gordon’s Higher-Order Logic
Popescu, A. (2025) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics65433.2025.00008 · Cited by 1
Ferguson, T. M., Kadlečíková, J., & Whitaker, M. (2025) · Synthese · doi:10.1007/s11229-025-05299-7 · Cited by 1
Landsman, K., & Singh, K. (2025) · Journal for General Philosophy of Science · doi:10.1007/s10838-025-09745-5 · Cited by 1
“52 Here one need not think of the full scope of Hilbert’s program; G ¨ odel’s completeness theorem is already meta-mathematical, as is its special case for propositional logic (Zach, 1999).”
Towards new characterizations of small circuit classes via discrete ordinary differential equations
Antonelli, M., Durand, A., & Kontinen, J. (2025) · Theoretical Computer Science · doi:10.1016/j.tcs.2025.115655 · Cited by 5
Sinnott, J. T., Martinez, Y., & Zhang, Y. (2025) · AI and Ethics · doi:10.1007/s43681-025-00846-x · Cited by 2
An Expressive Assertion Language for Quantum Programs
Su, B., Feng, Y., Ying, M., et al. (2026) · Proceedings of the ACM on Programming Languages · doi:10.1145/3776658 · Cited by 1
AI in geriatric psychiatry: precision meets human experience
Mizuno, A. N., Erickson, Z., Jimenez, D. E., & Aizenstein, H. J. (2026) · Neuropsychopharmacology · doi:10.1038/s41386-026-02328-y · Cited by 3
Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification
Yang, K., Poesia, G., He, J., Li, W., Lauter, K., Chaudhuri, S., & Song, D. X. (2026) · Communications of the ACM · doi:10.1145/3750038 · Cited by 11
Guler, T. M., Ros, P. R., & Ertürk, Ş. M. (2026) · Journal of the American College of Radiology · doi:10.1016/j.jacr.2026.02.020 · Cited by 1
Dialectical Materialism and Quantum Physics: The Unpublished 1957 Lectures of David Bohm in Israel
Gutfreund, H., & Renn, J. (2025) · doi:10.1093/9780198945925.001.0001 · Cited by 1
What Is Computation? And Why Turing?
Zhang, N. (2026) · Journal of Computer Science and Technology · doi:10.1007/s11390-026-6092-1 · Cited by 2
Ontology of Retention: Man Between Matter and Abstraction
Ushakov, D. (2026) · Философская мысль · doi:10.25136/2409-8728.2026.3.78700 · Cited by 1
Jurková, B., & Lacková, Ľ. (2026) · Biosystems · doi:10.1016/j.biosystems.2026.105804 · Cited by 1
Heterogeneous Dynamic Logic: Provability Modulo Program Theories
Teuber, S., Ulbrich, M., Platzer, A., & Beckert, B. (2026) · Proceedings of the ACM on Programming Languages · doi:10.1145/3808295 · Cited by 1
The Content-Binding Problem in Radical Enactivism: a case study of Korsakoff’s syndrome
Bielecka, K. (2026) · Philosophical Explorations · doi:10.1080/13869795.2026.2693484 · Cited by 1
From Human Sufficiency to Earth sufficiency: The role of nature quotient cultivation
Vuong, Q., & Nguyen, M.-H. (2026) · The Anthropocene Review · doi:10.1177/20530196261464206 · Cited by 2
Niklas, K. J. (2014) · Boston studies in the philosophy of science · doi:10.1007/978-94-017-9412-1_2 · Cited by 1
A Declarative Specification of Tree-Based Symbolic Arithmetic Computations
Tarau, P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-27694-1_20 · Cited by 1
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.