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 101–200 of 2,380
Uncertainty in computer application and its control through the engineering of software
Lehman, M. M. (1989) · Journal of Software Maintenance Research and Practice · doi:10.1002/smr.4360010103 · Cited by 79
Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
Schütte, K. (1950) · Mathematische Annalen · doi:10.1007/bf01342849 · Cited by 79
The Reception of Gödel’s Incompleteness Theorems
Dawson, J. W. (1985) · Birkhäuser Boston eBooks · doi:10.1007/978-0-8176-4769-8_7 · Cited by 77
Gómez‐Torrente, M. (1996) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1040067321 · Cited by 77
Gale, G. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.052 · Cited by 77
Mathematical and Philosophical Questions in the Theory of Open and Macroscopic Quantum Systems
Primas, H. (1990) · NATO ASI series. Series B : Physics · doi:10.1007/978-1-4684-8771-8_14 · Cited by 76
De Veritate: Austro-Polish Contributions to the Theory of Truth from Brentano to Tarski
Woleński, J., & SIMONS, P. M. (1989) · Nijhoff international philosophy series · doi:10.1007/978-94-009-2829-9_17 · Cited by 76
Automated Geography: What Kind of Geography for What Kind of Society?
Sheppard, E. S. (1993) · The Professional Geographer · doi:10.1111/j.0033-0124.1993.00457.x · Cited by 75
Quine, W. V. (1938) · Journal of Symbolic Logic · doi:10.2307/2267776 · Cited by 75
Tall, D. O. (2001) · Educational Studies in Mathematics · doi:10.1023/a:1016000710038 · Cited by 77
On the Unusual Effectiveness of Logic in Computer Science
Halpern, J. Y., Harper, R. W., Immerman, N., Kolaitis, P. G., Vardi, M. Y., & Vianu, V. (2001) · Bulletin of Symbolic Logic · doi:10.2307/2687775 · Cited by 79
Languages with self-reference II
Perlis, D. R. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90038-0 · Cited by 75
10.1016/b978-044488002-4/50031-2
(2000) · Time to knit · doi:10.1016/b978-044488002-4/50031-2 · Cited by 74
Finite Functions and the Necessary Use of Large Cardinals
Friedman, H. (1998) · Annals of Mathematics · doi:10.2307/121032 · Cited by 74
Feferman, S. (1968) · Lecture notes in mathematics · doi:10.1007/bfb0079094 · Cited by 74
Turing oracle machines, online computing, and three displacements in computability theory
Soare, R. I. (2009) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2009.01.008 · Cited by 111
Examining the Mathematics in Mathematics Teacher Education
Cooney, T. J., & Wiegel, H. G. (2003) · Springer eBooks · doi:10.1007/978-94-010-0273-8_26 · Cited by 90
On a Straw Man in the Philosophy of Science: A Defense of the Received View
Lutz, S. (2012) · HOPOS The Journal of the International Society for the History of Philosophy of Science · doi:10.1086/664460 · Cited by 75
The Empty Set, The Singleton, and the Ordered Pair
Kanamori, A. (2003) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1058448674 · Cited by 72
Hilbert's Program Then and Now
Zach, R. (2007) · Elsevier eBooks · doi:10.1016/b978-044451541-4/50014-2 · Cited by 72
Stress-free microbes lack vitality
Hallsworth, J. E. (2018) · Fungal Biology · doi:10.1016/j.funbio.2018.04.003 · Cited by 79
Drawing the boundary between subject and object: Comments on the mind-brain problem
Rosén, R. (1993) · Metamedicine · doi:10.1007/bf00997269 · Cited by 71
“Indeed, these attempts to secure Mathematics frorn paradox by invoking constructability, or formalizability, end up by losing most of it. This is one of the upshots of Godel's celebrated Incompleteness Theorem [ 11 ], which showed precisety that 'self-referential' statements (e.g.”
ResultBlum, L., & Blum, M. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2115934119 · Cited by 70
Data and Information Leakage Prevention Within the Scope of Information Security
Hauer, B. (2015) · IEEE Access · doi:10.1109/access.2015.2506185 · Cited by 75
“DLP AND ILP AS A CONCEPT OF INFORMATION SECURITY There are several theories within the scope of IS and especially IT security, such as the Kurt Gödel’s incompleteness theorem [19], the Alan Turing’s halting theorem [20], and the Rice-Myhill-Shapiro theorem [21], which proof that IT security is a matter of probability.”
MethodEinige Betrachtungen über die Begriffe der ω-Widerspruchsfreiheit und der ω-Vollständigkeit
Tarski, A. (1933) · Monatshefte für Mathematik · doi:10.1007/bf01708855 · Cited by 68
Arithmetical problems and recursively enumerable predicates
Davis, M. D. (1953) · Journal of Symbolic Logic · doi:10.2307/2266325 · Cited by 67
Recursive Functions and Intuitionistic Number Theory
Nelson, D. B. (1947) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1947-0025420-1 · Cited by 76
Bostock, D. (2012) · doi:10.1093/acprof:oso/9780199651443.001.0001 · Cited by 66
den Bulcke, M. V., Lievens, A., Barbau-Piednoir, E., Mbongolo-Mbella, G., Roosens, N. H. C., Sneyers, M., & Leunda-Casi, A. (2009) · Analytical and Bioanalytical Chemistry · doi:10.1007/s00216-009-3286-7 · Cited by 67
Does Mathematics Need New Axioms?
Feferman, S. (1999) · American Mathematical Monthly · doi:10.1080/00029890.1999.12005017 · Cited by 65
Chapter 34 Remarks on the Foundations of Agent-Based Generative Social Science
Epstein, J. M. (2006) · Handbook of computational economics · doi:10.1016/s1574-0021(05)02034-4 · Cited by 74
Non-standard models for formal logics
Rosser, J. B., & Wang, H. H. (1950) · Journal of Symbolic Logic · doi:10.2307/2266971 · Cited by 64
“From this it follows that L is co-inconsistent (see [5]).”
InfluentialRao, A., & Yehudayoff, A. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108671644 · Cited by 64
The systems of Leśniewski in relation to contemporary logical research
Grzegorczyk, A. (1955) · Studia Logica · doi:10.1007/bf02067248 · Cited by 63
Physical Hypercomputation and the Church–Turing Thesis
Shagrir, O., & Pitowsky, I. (2003) · Minds and Machines · doi:10.1023/a:1021365222692 · Cited by 64
Self-Evolution in a Constructive Binary String System
Dittrich, P., & Banzhaf, W. (1998) · Artificial Life · doi:10.1162/106454698568521 · Cited by 63
Jeroslow, R. G. (1973) · Journal of Symbolic Logic · doi:10.2307/2273028 · Cited by 62
DeMO: An Ontology for Discrete-event Modeling and Simulation
Silver, G. A., Miller, J. A., Hybinette, M., et al. (2010) · SIMULATION · doi:10.1177/0037549710386843 · Cited by 61
Ingerman, P. Z. (1966) · Elsevier eBooks · doi:10.1016/b978-1-4832-3104-4.50013-6 · Cited by 59
Bockmayr, A., Weispfenning, V., & Maher, M. J. (2001) · Elsevier eBooks · doi:10.1016/b978-044450813-3/50014-x · Cited by 60
On definable sets of positive integers )
Mostowski, A. (1979) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70461-6 · Cited by 62
Single-tape and multi-tape Turing machines through the lens of the Grossone methodology
Sergeyev, Y. D., & Garro, A. (2013) · The Journal of Supercomputing · doi:10.1007/s11227-013-0894-y · Cited by 55
“Finally, the third limitation already mentioned above has been disco vered by G̈odel in his two famous incompleteness theorems (see [11]).”
Schmidhuber, J. (2009) · Cognitive Computation · doi:10.1007/s12559-009-9014-y · Cited by 87
Models, validation, and applied geochemistry: Issues in science, communication, and philosophy
Nordstrom, D. (2012) · Applied Geochemistry · doi:10.1016/j.apgeochem.2012.07.007 · Cited by 60
“They continue to be an evolving discussion of how we see the place of science in our world and how science can contribute to important policies and decision making.”
BackgroundMML, Hybrid Bayesian Network Graphical Models, Statistical Consistency, Invariance and Uniqueness
Dowe, D. L. (2011) · Elsevier eBooks · doi:10.1016/b978-0-444-51862-0.50030-7 · Cited by 57
Set Theory from Cantor to Cohen
Kanamori, A. (2012) · Handbook of the history of logic · doi:10.1016/b978-0-444-51621-3.50001-3 · Cited by 58
Flat Parametric Counter Automata
Bozga, M. D., Iosif, R., & Lakhnech, Y. (2006) · Lecture notes in computer science · doi:10.1007/11787006_49 · Cited by 58
Interpretability of Elementary Theories
Szczerba, L. W. (1977) · Springer eBooks · doi:10.1007/978-94-010-1138-9_8 · Cited by 58
The theory of recursive functions, approaching its centennial
Kleene, S. C. (1981) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1981-14920-x · Cited by 68
Sieg, W. (2009) · Elsevier eBooks · doi:10.1016/b978-0-444-51555-1.50017-1 · Cited by 62
On undecidable statements in enlarged systems of logic and the concept of truth
Tarski, A. (1939) · Journal of Symbolic Logic · doi:10.2307/2266444 · Cited by 57
Undecidability of Macroscopically Distinguishable States in Quantum Field Theory
Komar, A. B. (1964) · Physical Review · doi:10.1103/physrev.133.b542 · Cited by 56
An informal exposition of proofs of Gödel's theorems and Church's theorem
Rosser, B. (1939) · Journal of Symbolic Logic · doi:10.2307/2269059 · Cited by 56
Griffiths, M. R., & Lucas, J. R. (2016) · Palgrave Macmillan UK eBooks · doi:10.1057/978-1-137-54187-1_2 · Cited by 56
Gödel Theorems for Non-Constructive Logics
Rosser, B. (1937) · Journal of Symbolic Logic · doi:10.2307/2266293 · Cited by 56
Über das Verhältnis zwischen intuitionistischer und klassischer Arithmetik
Gentzen, G. (1974) · Archive for Mathematical Logic · doi:10.1007/bf02015371 · Cited by 55
The challenge of computer mathematics
Barendregt, H. P., & Wiedijk, F. (2005) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2005.1650 · Cited by 62
“If e.g. aZ2, then aZSðSð0ÞÞ, a representation of the object 2 in the formal system.6 In these languages algorithms are represented as so called ‘logical programs’, as happened also in Gödel (1931).”
BackgroundAutomation of Higher-Order Logic
Benzmüller, C., & Miller, D. (2014) · Handbook of the history of logic · doi:10.1016/b978-0-444-51624-4.50005-8 · Cited by 55
The automation of proof: a historical and sociological exploration
MacKenzie, D. A. (1995) · IEEE Annals of the History of Computing · doi:10.1109/85.397057 · Cited by 56
The classical and the ω-complete arithmetic
Grzegorczyk, A., Mostowski, A. W., & Ryll-Nardzewski, C. (1958) · Journal of Symbolic Logic · doi:10.2307/2964398 · Cited by 55
“However, as we know from Godel's famous theorem [6], there is a large collection of non-isomorphic non-standard models of A.”
BackgroundCounting systems and the First Hilbert problem
Sergeyev, Y. D. (2009) · Nonlinear Analysis · doi:10.1016/j.na.2009.09.009 · Cited by 54
Complexity of Combinatorial Algorithms
Tarjan, R. E. (1978) · SIAM Review · doi:10.1137/1020067 · Cited by 56
The Prehistory and Early History of Automated Deduction
Davis, M. D. (1983) · Springer eBooks · doi:10.1007/978-3-642-81952-0_1 · Cited by 53
Quantum and Classical Structures in Nondeterminstic Computation
Pavlović, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00834-4_13 · Cited by 52
On the Philosophical Relevance of Godel's Incompleteness Theorems
Raattkainen, P. (2005) · Revue internationale de philosophie · doi:10.3917/rip.234.0513 · Cited by 76
Kanamori, A. (2004) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1102083759 · Cited by 52
A theory for mentally developing robots
Weng, J. (2003) · IEEE International Conference on Development and Learning (ICDL) · doi:10.1109/devlrn.2002.1011821 · Cited by 74
On Gödel incompleteness and finite combinatorics
Kanamori, A., & McAloon, K. (1987) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(87)90074-1 · Cited by 52
Newell and Simon's Logic Theorist: Historical Background and Impact on Cognitive Modeling
Gugerty, L. J. (2006) · Proceedings of the Human Factors and Ergonomics Society Annual Meeting · doi:10.1177/154193120605000904 · Cited by 83
Hilberts Logik. Von der Axiomatik zur Beweistheorie
Peckhaus, V. (1995) · NTM Zeitschrift für Geschichte der Wissenschaften Technik und Medizin · doi:10.1007/bf02913699 · Cited by 51
Dreben, B., & Kanamori, A. (1997) · Synthese · doi:10.1023/a:1004908225146 · Cited by 51
Perspective Shifts in Marketing: Toward a Paradigm Change?
Golinelli, G. M., Barile, S., Saviano, M., & Polese, F. (2012) · Service Science · doi:10.1287/serv.1120.0015 · Cited by 57
Arithmetical Truth and Hidden Higher-Order Concepts
Isaacson, D. (1987) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70552-x · Cited by 51
DISSENTING FROM SPATIAL ANALYSIS
Sheppard, E. (1995) · Urban Geography · doi:10.2747/0272-3638.16.4.283 · Cited by 51
Gu, M., Weedbrook, C., Perales, Á., & Nielsen, M. A. (2009) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2008.12.016 · Cited by 59
“Unlike physical systems, the axioms that define a mathematical system, its analogous ‘theory of everything’, are known; yet, many properties of such systems cannot be proven either true or false, and hence are formally undecidable [11].”
QED at Large: A Survey of Engineering of Formally Verified Software
Ringer, T., Palmskog, K., Sergey, I., Gligoric, M., & Tatlock, Z. (2019) · Foundations and Trends® in Programming Languages · doi:10.1561/2500000045 · Cited by 100
“However, he then subsequently established that even modest extensions of expressibility in first-order logic lead to incompleteness (Gödel, 1931): there can be no system that allows constructing proofs for all true propositions.”
BackgroundThe quantum coin toss-testing microphysical undecidability
Svozil, K. (1990) · Physics Letters A · doi:10.1016/0375-9601(90)90408-g · Cited by 49
A new method for undecidability proofs of first order theories
Treinen, R. (1992) · Journal of Symbolic Computation · doi:10.1016/0747-7171(92)90016-w · Cited by 49
Challenging the myths of entrepreneurship?
Rehn, A., Brännback, M. E., Carsrud, A. L., et al. (2013) · Entrepreneurship and Regional Development · doi:10.1080/08985626.2013.818846 · Cited by 49
“Schrödinger asked what we might really mean by an ‘observation’ in the quantum field, Gödel (1931) was interested in the notion of ‘proof’, Wittgenstein (1953/2001) changed philosophy by asking what we thought ‘language’ meant, and so on.”
BackgroundErnst Mach at the Crossroads of Twentieth‐Century Philosophy
Hintikka, J. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0005 · Cited by 49
Integral biomathics: A post-Newtonian view into the logos of bios
Simeonov, P. L. (2010) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2010.01.005 · Cited by 50
“(Gödel, 1931; Bagaria, 2003) – 22 –”
BackgroundComputing Machinery and Intelligence
Cooper, S. B., & Leeuwen, J. V. (2013) · Elsevier eBooks · doi:10.1016/b978-0-12-386980-7.50023-x · Cited by 50
Framing Artificial Intelligence (AI) Additive Manufacturing (AM)
Heiden, B., Alieksieiev, V., Volk, M., & Tonino-Heiden, B. (2021) · Procedia Computer Science · doi:10.1016/j.procs.2021.04.161 · Cited by 49
Henkin, L. (1953) · Journal of Symbolic Logic · doi:10.2307/2266323 · Cited by 46
The philosophy of mathematics and mathematics education
Ernest, P. (1985) · International Journal of Mathematical Education in Science and Technology · doi:10.1080/0020739850160505 · Cited by 46
A homogeneous system for formal logic
Martin, R. M. (1943) · Journal of Symbolic Logic · doi:10.2307/2267976 · Cited by 46
Über den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion
Péter, R. (1935) · Mathematische Annalen · doi:10.1007/bf01448046 · Cited by 46
In memoriam Kurt Go¨del: His 1931 correspondence with zermelo on his incompletability theorem
Grattan-Guinness, I. (1979) · Historia Mathematica · doi:10.1016/0315-0860(79)90127-7 · Cited by 46
The Task of the Logic of Science
Carnap, R. (1987) · Springer eBooks · doi:10.1007/978-94-009-3865-6_3 · Cited by 45
Discussion on the foundation of mathematics
Dawson, J. W. (1984) · History and Philosophy of Logic · doi:10.1080/01445348408837065 · Cited by 45
Bounias, M., & Krasnoholovets, V. (2003) · Kybernetes · doi:10.1108/03684920310483126 · Cited by 46
On models of axiomatic systems
Mostowski, A. W. (1979) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70256-3 · Cited by 44
Zur Theorie der konstruktiven Wohlordnungen
Markwald, W. (1954) · Mathematische Annalen · doi:10.1007/bf01361115 · Cited by 46
Kreisel, G., & Sacks, G. E. (1965) · Journal of Symbolic Logic · doi:10.2307/2269621 · Cited by 44
Climate Predictions: The Chaos and Complexity in Climate Models
Mihailović, D. T., Mimić, G., & Arsenić, I. (2014) · Advances in Meteorology · doi:10.1155/2014/878249 · Cited by 52
Alan Turing and the Mathematical Objection
Piccinini, G. (2003) · Minds and Machines · doi:10.1023/a:1021348629167 · Cited by 85
Undecidability in Number Theory
Koenigsmann, J. (2014) · Lecture notes in mathematics · doi:10.1007/978-3-642-54936-6_5 · Cited by 43
Provability: the emergence of a mathematical modality
Boolos, G., & Sambin, G. (1991) · Studia Logica · doi:10.1007/bf00370383 · Cited by 43
On Teaching Critical Thinking1
Mackenzie, J. (1991) · Educational Philosophy and Theory · doi:10.1111/j.1469-5812.1991.tb00176.x · Cited by 43
Hazen, A. (1983) · Springer eBooks · doi:10.1007/978-94-009-7066-3_5 · Cited by 42
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.