Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
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 401–500 of 2,380
The invention of the universal electronic computer—how the Electronic Computer Revolution began
Burks, A. W. (2002) · Future Generation Computer Systems · doi:10.1016/s0167-739x(02)00068-7 · Cited by 21
Essential Incompleteness of Arithmetic Verified by Coq
O’Connor, R. (2005) · Lecture notes in computer science · doi:10.1007/11541868_16 · Cited by 19
The cardinal hypotheses of Holoecology
Patten, B. C. (2015) · Ecological Modelling · doi:10.1016/j.ecolmodel.2015.08.004 · Cited by 19
Empirical Study on the Characteristics of Complex Networks in Networked Software
Ma, Y., He, K., Li, B., et al. (2011) · Journal of Software · doi:10.3724/sp.j.1001.2011.03934 · Cited by 19
On Decidability Within the Arithmetic of Addition and Divisibility
Bozga, M. D., & Iosif, R. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31982-5_27 · Cited by 19
Symbol security condition considered harmful
Schaefer, M. (2003) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.1989.36275 · Cited by 19
Calculating self-referential statements, I: Explicit calculations
Smoryński, C. (1979) · Studia Logica · doi:10.1007/bf00493670 · Cited by 19
The Classical and The ω-Complete Arithmetic
Grzegorczyk, A., Mostowski, A. W., & Ryll-Nardzewski, C. (1979) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70462-8 · Cited by 19
Automated reasoning with a constraint-based metainterpreter
Christiansen, H. (1998) · The Journal of Logic Programming · doi:10.1016/s0743-1066(98)10009-2 · Cited by 20
Neurodynamics: A critical survey
Scott, A. C. (1977) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(77)90039-6 · Cited by 20
Grue, K. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90296-r · Cited by 19
“In contrast, Gijdel’s incompleteness theorem [12] states that a formula may be provable, disprovable or undecidable.”
BackgroundFrom Heisenberg to Gödel via Chaitin
Svozil, K., Calude, C. S., & Stay, M. (2005) · International Journal of Theoretical Physics · doi:10.1007/s10773-005-7081-8 · Cited by 23
Gödel’s Undecidability Theorems and the Search for a Theory of Everything
Kiefer, C. (2024) · International Journal of Theoretical Physics · doi:10.1007/s10773-024-05574-2 · Cited by 19
Panexperiential materialism: A physical exploration of qualitativeness in the brain
Poznański, R. R., & Brändas, E. (2020) · Advances in quantum chemistry · doi:10.1016/bs.aiq.2020.08.004 · Cited by 29
Gershenson, C. (2023) · Artificial Life · doi:10.1162/artl_a_00397 · Cited by 31
Universalities in Cellular Automata*
Ollinger, N. (2012) · Springer eBooks · doi:10.1007/978-3-540-92910-9_6 · Cited by 21
Life is physics and chemistry and communication
Witzany, G. (2014) · Annals of the New York Academy of Sciences · doi:10.1111/nyas.12570 · Cited by 24
Arai, N., Matsuzaki, T., Iwane, H., & Anai, H. (2014) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2608628.2627488 · Cited by 22
Epistemology of Wave Function Collapse in Quantum Physics
Cowan, C. W., & Tumulka, R. (2014) · The British Journal for the Philosophy of Science · doi:10.1093/bjps/axu038 · Cited by 32
Testing quantum theory with thought experiments
Nurgalieva, N., & Renner, R. (2020) · Contemporary Physics · doi:10.1080/00107514.2021.1880075 · Cited by 32
Kanamori, A. (2007) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1185803804 · Cited by 18
Recursive Functionals and Quantifiers of Finite Types Revisited I
Kleene, S. C. (1978) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70933-9 · Cited by 32
Philosophical implications of Tarski's work
Suppes, P. (1988) · Journal of Symbolic Logic · doi:10.1017/s0022481200028930 · Cited by 18
The methodology of the social sciences
Bohman, J. F. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.058 · Cited by 18
Aquistapace, F., Amigó, N., Troncoso, J. F., Deluigi, O. R., & Bringa, E. M. (2023) · Computational Materials Science · doi:10.1016/j.commatsci.2023.112263 · Cited by 17
Fritz, P. (2024) · Cambridge University Press eBooks · doi:10.1017/9781009177740 · Cited by 17
A Groupoid of Isomorphic Data Transformations
Tarau, P. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02614-0_17 · Cited by 17
Hatfield, G. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.009 · Cited by 40
Numerical Computations with Infinite and Infinitesimal Numbers: Theory and Applications
Sergeyev, Y. D. (2013) · Springer proceedings in mathematics & statistics · doi:10.1007/978-1-4614-7582-8_1 · Cited by 17
Etchemendy and Bolzano on Logical Consequence
Rusnock, P., & Burke, M. (2010) · History and Philosophy of Logic · doi:10.1080/01445340903445063 · Cited by 17
REREADING TARSKI ON LOGICAL CONSEQUENCE
Gómez‐Torrente, M. (2009) · The Review of Symbolic Logic · doi:10.1017/s1755020309090200 · Cited by 17
Characterizing existence of equilibrium for large extensive form games: a necessity result
Alós‐Ferrer, C., & Ritzberger, K. (2015) · Economic Theory · doi:10.1007/s00199-015-0937-0 · Cited by 17
Derbentsev, V. D., Сердюк, О. А., Соловйов, В. М., & Шарапов, О. Д. (2010) · doi:10.31812/0564/1045 · Cited by 70
Towards new concepts for a biological neuroscience of consciousness
Signorelli, C. M., & Meling, D. (2021) · Cognitive Neurodynamics · doi:10.1007/s11571-020-09658-7 · Cited by 25
“The philosophical attitude supporting our model is strongly influenced by the modern approach to formal mathematics after Gödel’s incompleteness theorems (Gödel 1931).”
MethodHodges, W. (2001) · Springer eBooks · doi:10.1007/978-94-015-9833-0_1 · Cited by 25
Algorithms as complementary abstractions
Matzner, T. (2022) · New Media & Society · doi:10.1177/14614448221078604 · Cited by 25
Quantum Software Engineering Landscape and Challenges
Piattini, M. G., & Murillo, J. M. (2022) · Springer eBooks · doi:10.1007/978-3-031-05324-5_2 · Cited by 19
Moore, G. M. (1987) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70656-1 · Cited by 17
Measurement-Based Quantum Computation and Undecidable Logic
Van den Nest, M., & Briegel, H. J. (2008) · Foundations of Physics · doi:10.1007/s10701-008-9212-6 · Cited by 17
On arithmetical first-order theories allowing encoding and decoding of lists
Cégielski, P., & Richard, D. (1999) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00281-8 · Cited by 17
On Gödel's Way In: The Influence of Rudolf Carnap
Goldfarb, W. (2005) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1120231629 · Cited by 17
Feferman, S., & Strahm, T. (2010) · The Review of Symbolic Logic · doi:10.1017/s1755020310000183 · Cited by 17
The Σ1-provability logic of HA
Ardeshir, M., & Mojtahedi, M. (2018) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2018.05.001 · Cited by 17
Über den Symbolismus der Mathematik und mathematischen Physik
Weyl, V. H. (1971) · Springer eBooks · doi:10.1007/978-3-642-65129-8_3 · Cited by 17
Rudimentary relations and primitive recursion: A toolbox
Esbelin, H.-A., & More, M. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00002-9 · Cited by 17
Peres, A. (1985) · Foundations of Physics · doi:10.1007/bf00735292 · Cited by 22
Postinstability models in dynamics
Zak, M. A. (1994) · International Journal of Theoretical Physics · doi:10.1007/bf00675803 · Cited by 17
Weigend, A. S. (1994) · Philosophical Transactions of the Royal Society of London Series A Physical and Engineering Sciences · doi:10.1098/rsta.1994.0100 · Cited by 18
A complete theory of natural, rational, and real numbers
Myhill, J. R. (1950) · Journal of Symbolic Logic · doi:10.2307/2266784 · Cited by 17
The Problem of Organismic Reliability
Cowan, J. D. (1965) · Progress in brain research · doi:10.1016/s0079-6123(08)60154-5 · Cited by 17
Complementarity in Language; Toward a General Understanding
Löfgren, L. (1992) · Springer eBooks · doi:10.1007/978-94-011-2779-0_8 · Cited by 17
Franks, C. (2010) · History and Philosophy of Logic · doi:10.1080/01445340.2010.522365 · Cited by 16
An Algorithm for Linearizing the Collatz Convergence
Rahn, A., Sultanow, E., Henkel, M., et al. (2021) · Mathematics · doi:10.3390/math9161898 · Cited by 16
The paradox of the self-studying brain
Battaglia, S., Servajean, P., & Friston, K. J. (2025) · Physics of Life Reviews · doi:10.1016/j.plrev.2024.12.009 · Cited by 21
The Physical Origin of Physically Useful Mathematics
Lützen, J. (2011) · Interdisciplinary Science Reviews · doi:10.1179/030801811x13082311482609 · Cited by 16
An embedded declarative data transformation language
Tarau, P. (2009) · doi:10.1145/1599410.1599432 · Cited by 16
“…two problems: Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.”
BackgroundExamining the Limits of Physical Theory
Brändas, E. (2012) · Advances in quantum chemistry · doi:10.1016/b978-0-12-397009-1.00002-3 · Cited by 17
The Development of Self-Reference: Löb’s Theorem
Smoryński, C. (2008) · Birkhäuser Boston eBooks · doi:10.1007/978-0-8176-4769-8_9 · Cited by 16
Wuyts, V., Mattheus, W., Roosens, N. H. C., Marchal, K., Bertrand, S., & Keersmaecker, S. C. J. D. (2015) · Applied Microbiology and Biotechnology · doi:10.1007/s00253-015-6831-7 · Cited by 18
Goethe's dream: Challenges and opportunities for synthetic biology
Moyá, A., Krasnogor, N., Peretó, J. G., & Latorre, A. (2009) · EMBO Reports · doi:10.1038/embor.2009.120 · Cited by 21
Схемы рефлексии и алгебры доказуемости в формальной арифметике
Beklemishev, L. D., & Beklemishev, L. D. (2005) · Успехи математических наук · doi:10.4213/rm1401 · Cited by 16
Extensional higher-order resolution
Benzmüller, C., & Kohlhase, M. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054248 · Cited by 16
Kojman, M., Lee, G., Omri, E., et al. (2008) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2007.12.006 · Cited by 16
Релятивистская квантовая эконофизика. Новые парадигмы моделирования сложных систем
Saptsin, V., & Соловйов, В. М. (2009) · Брама-Україна eBooks · doi:10.31812/0564/1128 · Cited by 17
Willard, E. D. (1993) · Lecture notes in computer science · doi:10.1007/bfb0022580 · Cited by 16
The Gödel Incompleteness Theorem and Decidability over a Ring
Blum, L., & Smale, S. (1993) · Springer eBooks · doi:10.1007/978-1-4612-2740-3_32 · Cited by 16
The diagnostic process as a statistical-causal analysis
Westmeyer, H. (1975) · Theory and Decision · doi:10.1007/bf00139821 · Cited by 17
General Principles of Operations in Neuron Nets with Application to Acoustical Pattern Recognition
Müeller, P., Martin, T., & Putzrath, F. L. (1962) · Springer eBooks · doi:10.1007/978-1-4684-1716-6_29 · Cited by 16
Structuralism and Meta-Mathematics
Friederich, S. (2010) · Erkenntnis · doi:10.1007/s10670-010-9210-x · Cited by 15
Jezik naravoslovja in razvijanje naravoslovne pismenosti
Ambrožič‐Dolinšek, J. (2021) · University of Maribor, University Press eBooks · doi:10.18690/978-961-286-488-0.14 · Cited by 14
Parikh, R. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0016 · Cited by 15
Typed syntactic meta-programming
Devriese, D., & Piessens, F. (2013) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/2500365.2500575 · Cited by 15
Cut-Elimination for Quantified Conditional Logic
Benzmüller, C. (2016) · Journal of Philosophical Logic · doi:10.1007/s10992-016-9403-0 · Cited by 27
“Gödel’s incompleteness theorem [42] can be extended directly to HOL since second-order quantification can be used to define Peano arithmetic: that is, there is a “true” formula of HOL (or any extension of it) that is not provable.”
BackgroundZhang, W.-R. (2017) · doi:10.1109/ijcnn.2017.7965986 · Cited by 15
“If the self-consistency of BDL can be proven within itself using BL, Gödel’s incompleteness theorems [13] would be overturned.”
BackgroundThe impact of factitious disorder on the physician-patient relationship. An epistemological model
Feltz-Cornelis, C. M. V. D. (2002) · Medicine Health Care and Philosophy · doi:10.1023/a:1021106022330 · Cited by 15
A Review and Proposed Framework for Artificial General Intelligence
Long, L. N., & Cotner, C. F. (2019) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero.2019.8742125 · Cited by 20
Three Roles of Empirical Information in Philosophy: Intuitions on Mathematics do Not Come for Free
Kant, D., Pérez‐Escobar, J. A., & Sarikaya, D. (2021) · Kriterion – Journal of Philosophy · doi:10.1515/krt-2021-0025 · Cited by 16
Grattan-Guinness, I. (2002) · Historia Mathematica · doi:10.1006/hmat.2002.2356 · Cited by 15
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Gramlich, B. (2005) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.01.006 · Cited by 15
Farley, J. D. (2007) · Studies in Conflict and Terrorism · doi:10.1080/10576100701611304 · Cited by 15
“…produce a phase transition, just as (to give another very loose analogy) Arrow’s impossibility theorem (Arrow 1951) or Gödel’s incompleteness theorems (Gödel 1931) only require very reasonable conditions on the objects of interest (voting systems and axiom schemes for mathematics, respectively).”
BackgroundHromkovic̆, J., & Lacher, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-71483-7_1 · Cited by 15
The Incompleteness of the Economy and Business: A Forceful Reminder
Dembinski, P. H. (2011) · Journal of Business Ethics · doi:10.1007/s10551-011-1185-2 · Cited by 15
The debate over the Geisteswissenschaften in German philosophy
Anderson, R. L. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.017 · Cited by 38
Perlis, D. R. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90003-3 · Cited by 15
McCulloch, W. S. (1956) · Acta Biotheoretica · doi:10.1007/bf01557008 · Cited by 15
Willard, D. E. (2006) · Journal of Symbolic Logic · doi:10.2178/jsl/1164060451 · Cited by 17
Stability of Approximation Algorithms for Hard Optimization Problems
Hromkovic̆, J. (1999) · Lecture notes in computer science · doi:10.1007/3-540-47849-3_2 · Cited by 15
Phase transitions for Gödel incompleteness
Weiermann, A. (2008) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2008.09.012 · Cited by 15
A Practical Framework for Portfolio ChoicePreprint
Michaud, R. O. (2015) · SSRN Electronic Journal · doi:10.2139/ssrn.2658642 · Cited by 15
The Origin of Metazoa: An Algorithmic View of Life
Giacomo, R. D., Schwartz, J. H., & Maresca, B. (2013) · Biological Theory · doi:10.1007/s13752-013-0131-1 · Cited by 14
Life on the Ship of Neurath: Mathematics in the Philosophy of Mathematics
Shapiro, S. (2011) · Springer eBooks · doi:10.1007/978-94-007-2390-0_2 · Cited by 14
Symbolic Languages and Natural Structures a Mathematician’s Account of Empiricism
Burchard, H. G. W. (2005) · Foundations of Science · doi:10.1007/s10699-004-3068-9 · Cited by 18
Quine, W. V. (1937) · Journal of Symbolic Logic · doi:10.2307/2266290 · Cited by 14
San, W. K. (2023) · Mind · doi:10.1093/mind/fzac048 · Cited by 14
“…shed light on the debate on positive introspection as well as on foundational epistemological issues concerning the structure and limits of knowability.51 50These logical constraints on the limits of knowability are reminiscent of the constraints on the limits of formal provability (Gödel (1931)).”
BackgroundAI-driven research in pure mathematics and theoretical physics
He, Y. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00740-1 · Cited by 28
Portmann, E., & Witold Pedrycz, C. (2013) · Intelligent systems reference library · doi:10.1007/978-3-642-39739-4_5 · Cited by 14
Nadin, M. (2016) · Springer eBooks · doi:10.1007/978-3-319-45142-8_9 · Cited by 13
Papakonstantinidis, L. A. (2017) · International Journal of Innovation and Economic Development · doi:10.18775/ijied.1849-7551-7020.2015.35.2001 · Cited by 13
Similia Similibus Curentur: Theory, History, and Status of the Constitutive Principle of Homeopathy
Schmidt, J. M. (2021) · Homeopathy · doi:10.1055/s-0041-1725061 · Cited by 14
Douven, I., Elqayam, S., & Krzyżanowska, K. (2023) · Palgrave studies in pragmatics, language and cognition · doi:10.1007/978-3-031-05682-6_7 · Cited by 19
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.