Ü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 301–400 of 2,380
Mass problems associated with effectively closed sets
Simpson, S. G. (2011) · Tohoku Mathematical Journal · doi:10.2748/tmj/1325886278 · Cited by 28
Completely Self-referential Optimal Reinforcement Learners
Schmidhuber, J. (2005) · Lecture notes in computer science · doi:10.1007/11550907_36 · Cited by 33
Confessions of a Confirmed Extensionalist
Quine, W. V. O. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0010 · Cited by 42
Truth definitions and consistency proofs
Wang, H. (1952) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1952-0049136-2 · Cited by 28
Primas, H. (1992) · Open Systems & Information Dynamics · doi:10.1007/bf02228933 · Cited by 30
Antirealism and the Roles of Truth
Sundholm, G. (2004) · Springer eBooks · doi:10.1007/978-1-4020-1986-9_11 · Cited by 32
East-West paths to unconventional computing
Adamatzky, A., Akl, S. G., Burgin, M., Calude, C. S., Costa, J. F., Dehshibi, M. M., Gunji, Y., Konkoli, Z., MacLennan, B. J., Marchal, B., et al. (2017) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2017.08.004 · Cited by 29
Wittgenstein's Philosophy of Mathematics
Floyd, J. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108687126 · Cited by 41
Limitations of Deep Learning for Inverse Problems on Digital Hardware
Boche, H., Fono, A., & Gitta Kutyniok, B. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3326879 · Cited by 40
Computation and Hypercomputation
Stannett, M. (2003) · Minds and Machines · doi:10.1023/a:1021341202779 · Cited by 30
Gene networks and liar paradoxes
Isalan, M. (2009) · BioEssays · doi:10.1002/bies.200900072 · Cited by 26
Ernest, P. (2016) · Trends in the history of science · doi:10.1007/978-3-319-28582-5_12 · Cited by 27
Inadequacy of Modal Logic in Quantum Settings
Nurgalieva, N., & del Rio, L. (2019) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.287.16 · Cited by 48
Some theorems on definability and decidability
Church, A., & Quine, W. V. O. (1952) · Journal of Symbolic Logic · doi:10.2307/2267689 · Cited by 29
Demonstrating quantum random with single photons
Bronner, P., Strunz, A., Silberhorn, C., & Meyn, J.-P. (2009) · European Journal of Physics · doi:10.1088/0143-0807/30/5/026 · Cited by 29
A problem concerning the notion of definability
Tarski, A. (1948) · Journal of Symbolic Logic · doi:10.2307/2267331 · Cited by 27
Carnap’s dream: Gödel, Wittgenstein, and Logical, Syntax
Awodey, S., & Carus, A. W. (2006) · Synthese · doi:10.1007/s11229-006-9066-4 · Cited by 26
“He goes on to say that he intends to use this idea to give a truth definition in Part II of his paper (presumably the missing sequel to Gödel, 1931a).”
BackgroundUndecidability in quantum thermalization
Shiraishi, N., & Matsumoto, K. (2021) · Nature Communications · doi:10.1038/s41467-021-25053-0 · Cited by 48
A philosophical view on singularity and strong AI
Hoffmann, C. H. (2022) · AI & Society · doi:10.1007/s00146-021-01327-5 · Cited by 33
Codification, Abstraction, and Firm Differences: A Cognitive Information-based Perspective
Boisot, M. H., & Li, Y. (2005) · Journal of Bioeconomics · doi:10.1007/s10818-005-3940-x · Cited by 32
Experimental logics and Δ inf2 sup0 - theories
Jeroslow, R. G. (1975) · Journal of Philosophical Logic · doi:10.1007/bf00262039 · Cited by 26
We have never been positivist†
Sheppard, E. (2014) · Urban Geography · doi:10.1080/02723638.2014.916907 · Cited by 36
“If logical empiricism was dead, it was far from buried.3 Contemporary philosophical debates still echo to its claims (Creath, 2011; Gödel, 1931; Passmore, 1967; Popper, 1959; Uebel, 2011).”
Loops and Self-Reference in the Construction of Dictionaries
Levary, D., Eckmann, J., Moses, E., et al. (2012) · Physical Review X · doi:10.1103/physrevx.2.031018 · Cited by 26
A Survey of Automated Deduction
Bundy, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48317-9_6 · Cited by 25
Evolving Intelligence in Humans and Machines: Integrative Evolving Connectionist Systems Approach
Kasabov, N. K. (2008) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2008.926584 · Cited by 26
Hybrid Multi-agent Systems: Integrating Swarming and BDI Agents
Parunak, H. V. D., Nielsen, P. E., Brueckner, S., & Alonso, R. D. H. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-69868-5_1 · Cited by 28
Calude, C. S., Jürgensen, H., & Zimand, M. (1994) · Applied Mathematics and Computation · doi:10.1016/0096-3003(94)90158-9 · Cited by 30
Uspensky, V., & Semenov, A. L. (1981) · Lecture notes in computer science · doi:10.1007/3-540-11157-3_27 · Cited by 33
van Atten, M., & Kennedy, J. C. (2009) · Handbook of the history of logic · doi:10.1016/s1874-5857(09)70014-7 · Cited by 25
Aspekte der frege–hilbert-korrespondenz
Wehmeier, K. F. (1997) · History and Philosophy of Logic · doi:10.1080/01445349708837289 · Cited by 25
The incompleteness theorems after 70 years
Kotlarski, H. (2003) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2003.10.012 · Cited by 27
The problem of certainty in mathematics
Ernest, P. (2015) · Educational Studies in Mathematics · doi:10.1007/s10649-015-9651-x · Cited by 27
Crossley, J. N. (1975) · Lecture notes in mathematics · doi:10.1007/bfb0062850 · Cited by 25
Adversus Singularitates: The Ontology of Space–Time Singularities
Romero, G. E. (2012) · Foundations of Science · doi:10.1007/s10699-012-9309-4 · Cited by 31
“The first theorem states that any effectively generated theory capable of expressing elementary arithmetic cannot be both consistent and complete (Gödel 1931).”
BackgroundPaulson, L. C. (2014) · The Review of Symbolic Logic · doi:10.1017/s1755020314000112 · Cited by 25
“Gödel (1931) and Świerczkowski (2003) present full details.”
BackgroundTait, W. W. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316755983.020 · Cited by 25
ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
Priese, L. (1976) · Journal of Cybernetics · doi:10.1080/01969727608927527 · Cited by 26
Positivist thought in the nineteenth century
Harré, R. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.003 · Cited by 28
Impossibility Results in AI: A Survey
Brcic, M., & Yampolskiy, R. V. (2021) · ACM Computing Surveys · doi:10.1145/3603371 · Cited by 38
Notions of computability at higher types I
Longley, J. R. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316755884.004 · Cited by 26
Linguistic Knowledge of Reality: A Metaphysical Impossibility?
Nescolarde‐Selva, J. A., Usó-Doménech, J. L., & Sabán, M. J. (2014) · Foundations of Science · doi:10.1007/s10699-014-9347-1 · Cited by 24
The metamathematics of ergodic theory
Avigad, J. D. (2008) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2008.09.001 · Cited by 22
Farmer, W. M. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73086-6_6 · Cited by 24
2006: Celebrating 75 Years of AI - History and Outlook: The Next 25 Years
Schmidhuber, J. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77296-5_4 · Cited by 34
The metalogic of economic predictions, calculations and propositions
Albin, P. S. (1982) · Mathematical Social Sciences · doi:10.1016/0165-4896(82)90016-6 · Cited by 24
Lambek, J. (1980) · Advances in Mathematics · doi:10.1016/0001-8708(80)90013-4 · Cited by 24
Mixed qualitative-simulation methods: Understanding geography through thick and thin
Millington, J. D. A., & Wainwright, J. (2016) · Progress in Human Geography · doi:10.1177/0309132515627021 · Cited by 32
Types in Logic and Mathematics Before 1940
Kamareddine, F., Laan, T., & Nederpelt, R. (2002) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1182353871 · Cited by 24
Some undecidable determined games
Jones, J. P. (1982) · International Journal of Game Theory · doi:10.1007/bf01769063 · Cited by 24
Kleene, S. C. (1976) · Journal of Symbolic Logic · doi:10.2307/2272394 · Cited by 24
Key notions of Tarski's methodology of deductive systems
Czelakowski, J., & Malinowski, G. (1985) · Studia Logica · doi:10.1007/bf00370426 · Cited by 25
Landauer principle and thermodynamics of computation
Chattopadhyay, P., Misra, A., Pandit, T., & Paul, G. (2025) · Reports on Progress in Physics · doi:10.1088/1361-6633/add6b3 · Cited by 51
ON ONTOLOGY AND REALISM IN MATHEMATICS
Gaifman, H. (2012) · The Review of Symbolic Logic · doi:10.1017/s1755020311000372 · Cited by 25
Machine-learning mathematical structures
He, Y. (2022) · International Journal of Data Science in the Mathematical Sciences · doi:10.1142/s2810939222500010 · Cited by 50
Paradoxes, Self-Reference and Truth in the 20th Century
Andrea, C. (2009) · Handbook of the history of logic · doi:10.1016/s1874-5857(09)70020-2 · Cited by 23
Facing Complexity: Prediction vs. Adaptation
Gershenson, C. (2012) · Understanding complex systems · doi:10.1007/978-3-642-32817-6_2 · Cited by 26
Luitzen Egbertus Jan Brouwer, 1881-1966
Kreisel, G., & Newman, M. H. A. (1969) · Biographical Memoirs of Fellows of the Royal Society · doi:10.1098/rsbm.1969.0002 · Cited by 23
Day, T. (2011) · Journal of The Royal Society Interface · doi:10.1098/rsif.2011.0479 · Cited by 33
Only Two Letters: The Correspondence between Herbrand and Gödel
Sieg, W. (2005) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1120231628 · Cited by 23
A new method for undecidability proofs of first order theories
Treinen, R. (1990) · Lecture notes in computer science · doi:10.1007/3-540-53487-3_34 · Cited by 23
Weijs, S. V., & Ruddell, B. L. (2020) · Water Resources Research · doi:10.1029/2019wr026471 · Cited by 27
Standard logics as theories of argument and inference: Deduction
Woods, J. (2002) · Studies in logic and practical reasoning · doi:10.1016/s1570-2464(02)80004-0 · Cited by 22
External and internal syntax of the λ -calculus
Sato, M., & Pollack, R. (2010) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2010.01.010 · Cited by 22
Unprovability comes to machine learning
Reyzin, L. (2019) · Nature · doi:10.1038/d41586-019-00012-4 · Cited by 25
Bäuerle, R., & Cresswell, M. J. (1989) · Springer eBooks · doi:10.1007/978-94-009-1171-0_7 · Cited by 22
Theories of Truth Which Have No Standard Models
Leitgeb, H. (2001) · Studia Logica · doi:10.1023/a:1011950105814 · Cited by 22
Kohlhase, M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59338-1_43 · Cited by 22
Simulating conversations: The communion game
Cowley, S. J., & MacDorman, K. F. (1995) · AI & Society · doi:10.1007/bf01210600 · Cited by 23
The Reception of Gödel's Incompleteness Theorems
Dawson, J. W. (1984) · PSA Proceedings of the Biennial Meeting of the Philosophy of Science Association · doi:10.1086/psaprocbienmeetp.1984.2.192508 · Cited by 21
On the computational complexity of ethics: moral tractability for minds and machines
Stenseke, J. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10732-3 · Cited by 37
Why von Neumann Rejected Carnap’s Dualism of Information Concepts
Köhler, E. (2001) · Springer eBooks · doi:10.1007/978-94-017-2012-0_8 · Cited by 21
Logical independence and quantum randomness
Paterek, T., Kofler, J., Prevedel, R., Klimek, P., Aspelmeyer, M., Zeilinger, A., & Brukner, Č. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/1/013019 · Cited by 26
A modular architecture for transparent computation in recurrent neural networks
Carmantini, G. S., Graben, P. B., Desroches, M., & Rodrigues, S. (2016) · Neural Networks · doi:10.1016/j.neunet.2016.09.001 · Cited by 23
“A Gödel encoding (or Gödelization, see Gödel, 1931) allows one to uniquely assign a real number to a sequence such that the space of one-sided infinite sequences can be mapped to the real interval [0, 1].4 For completeness, Gödelization is subsequently discussed alongside its graphical…”
BackgroundComputing Machinery and Intelligence
Turing, A. M. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/4626.003.0002 · Cited by 21
Computing Machines Can't Be Intelligent (...and Turing Said So)
Kugel, P. (2002) · Minds and Machines · doi:10.1023/a:1021150928258 · Cited by 21
The Otto Loewi Lecture Loewi's discovery and the XXI century
Karczmar, A. G. (1996) · Progress in brain research · doi:10.1016/s0079-6123(08)62084-1 · Cited by 26
The Role of Heuristics in Models of Decision
Groner, R., Groner, M. T., & Bischof, W. F. (1983) · Advances in psychology · doi:10.1016/s0166-4115(08)62195-0 · Cited by 22
Two Dogmas of Computationalism
Shagrir, O. (1997) · Minds and Machines · doi:10.1023/a:1008236522699 · Cited by 30
Does God play dice? A discussion of some interpretations of quantum mechanics
Ross-Bonney, A. A. (1975) · Il Nuovo cimento della Società italiana di fisica. B/Il Nuovo cimento B · doi:10.1007/bf02721493 · Cited by 25
Physics of selective systems: Computation and biology
Rothstein, J. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857734 · Cited by 21
Kurt Gödel and the Consistency of R##
Meyer, R. K. (1996) · Lecture notes in logic · doi:10.1007/978-3-662-21963-8_18 · Cited by 20
Arguing deep ideational change
Kornprobst, M., & Senn, M. A. (2016) · Contemporary Politics · doi:10.1080/13569775.2016.1213078 · Cited by 19
Uher, J. (2014) · Springer eBooks · doi:10.1007/978-3-319-10130-9_13 · Cited by 25
Diffusion of Ar in K-feldspar: Present and absent
Villa, I. M. (2013) · Geological Society London Special Publications · doi:10.1144/sp378.4 · Cited by 20
A Review of Mathematical Knowledge Management
Carette, J., & Farmer, W. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02614-0_21 · Cited by 24
“While G¨ odel’s incompleteness theorem [ 23 ] certainly put an understandable damper on these developments, luckily many nevertheless persevered.”
BackgroundMatthews, S. W., & Danesi, M. (2019) · Chinese Semiotic Studies · doi:10.1515/css-2019-0013 · Cited by 28
Lexcellent, C. (2019) · SpringerBriefs in applied sciences and technology · doi:10.1007/978-3-030-21445-6_2 · Cited by 26
Essential Incompleteness of Arithmetic Verified by Coq
O’Connor, R. (2005) · Radboud Repository (Radboud University) · doi:10.48550/arxiv.cs/0505034 · Cited by 20
Inductively Presented Systems and the Formalization of Meta-Mathematics
Feferman, S. (1982) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70506-3 · Cited by 20
A methodology for conducting interdisciplinary social research
van Dijkum, C. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00072-2 · Cited by 20
“G odel (1931) in particular explored the boundaries of Hilbert's program, attempting to push the principles of the program to the limit in order to demonstrate that the theorems of logic and mathematics could all be produced using ®nite mechanical procedures (algorithms).”
BackgroundTolerance and Analyticity in Carnap's Philosophy of Mathematics
Friedman, M. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0011 · Cited by 20
Remarks on the development of computability
Shapiro, S. (1983) · History and Philosophy of Logic · doi:10.1080/01445348308837055 · Cited by 23
Artificial Societies of Intelligent AgentsPreprint
Gershenson, C. (2003) · SSRN Electronic Journal · doi:10.2139/ssrn.371641 · Cited by 20
Further Reflections on Sentences Saying of Themselves Strange Things
Zardini, E. (2017) · Logic and Logical Philosophy · doi:10.12775/llp.2017.004 · Cited by 19
Wittgenstein and Gödel: An Attempt to Make ‘Wittgenstein’s Objection’ Reasonable†
Lampert, T. (2017) · Philosophia Mathematica · doi:10.1093/philmat/nkx017 · Cited by 19
Software Model Checking: 20 Years and Beyond
Beyer, D., & Podelski, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22337-2_27 · Cited by 26
Gödelian structures and self‐organization in biological systems
Brändas, E. (2010) · International Journal of Quantum Chemistry · doi:10.1002/qua.22616 · Cited by 19
Further Reflections on the “Postmodern Turn” in the Social Sciences: A Reply to William Outhwaite
Susen, S. (2016) · International Journal of Politics Culture and Society · doi:10.1007/s10767-016-9230-x · Cited by 19
Simplicity as a Route to Impact in Materials Research
Tian, X., Lind, K. R., Yuan, B., Shaw, S., Siemianowski, O., & Cademartiri, L. (2017) · Advanced Materials · doi:10.1002/adma.201604681 · Cited by 20
Is There an Elegant Universal Theory of Prediction?
Legg, S. (2006) · Lecture notes in computer science · doi:10.1007/11894841_23 · Cited by 23
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.