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 801–900 of 2,380
Rössler, O. E., & Rossler, J. O. (1993) · Applied Mathematics and Computation · doi:10.1016/0096-3003(93)90125-x · Cited by 6
Formalism and intuition in computability
Soare, R. I. (2012) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2011.0335 · Cited by 7
La Logique Mathématique en sa jeunesse
Guillaume, M. (1994) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-9114-1_5 · Cited by 6
Weiner, J. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0003 · Cited by 22
Gardner, S. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.010 · Cited by 6
Informational Worldview. Scientific Foundations, and Philosophical Perspectives
Stacewicz, P. (2016) · Studies in Logic Grammar and Rhetoric · doi:10.1515/slgr-2016-0054 · Cited by 6
The power of negative [theoretical] results
Wagner, G. P. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1718862114 · Cited by 6
Yamane, S. (2017) · IEEE Global Conference on Consumer Electronics (GCCE) · doi:10.1109/gcce.2017.8229475 · Cited by 6
Gillibert, P., & Ranieri, G. (2019) · International Journal of Number Theory · doi:10.1142/s1793042119500908 · Cited by 6
The topology of human reflection: Comparison with finite automata
Trofimov, V. M. (2019) · Science for Education Today · doi:10.15293/2658-6762.1905.07 · Cited by 6
The Abstraction/Representation Account of Computation and Subjective Experience
Szangolies, J. (2020) · Minds and Machines · doi:10.1007/s11023-020-09522-x · Cited by 9
“Or take the Gödel-sentence G of some formal system F: both the extension of the system by G, and the extension by its negation ¬G yield consistent systems (Gödel 1931).”
BackgroundKripke, S. A. (2021) · History and Philosophy of Logic · doi:10.1080/01445340.2021.1976052 · Cited by 6
Robinson, W. S. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139046855.005 · Cited by 10
The universal numbers. From Biology to Physics
Marchal, B. (2015) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2015.06.013 · Cited by 7
Wiener's refiguring of a cybernetic design theor
Fischer, T. (2014) · IEEE Conference on Norbert Wiener in the 21st Century (21CW) · doi:10.1109/norbert.2014.6893913 · Cited by 7
Problems of solvability and choice of algorithms for decision making by precedence
Краснопрошин, В. В., & Obraztsov, V. A. (2006) · Pattern Recognition and Image Analysis · doi:10.1134/s1054661806020027 · Cited by 6
Vallverdú, J. (2017) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2017.09.002 · Cited by 5
Possible origins of consciousness in simple control over “involuntary” neuroimmunological action
Clark, K. B. (2018) · Consciousness and Cognition · doi:10.1016/j.concog.2018.04.002 · Cited by 7
A Logical Approach for the Schedulability Analysis of CCSL
Zhang, Y., Mallet, F., Zhu, H., et al. (2019) · International Symposium on Theoretical Aspects of Software Engineering (TASE) · doi:10.1109/tase.2019.00-23 · Cited by 6
Towards a model-theoretic framework for describing the semantic aspects of cognitive processes
Miguel-Tomé, S. (2020) · ADCAIJ ADVANCES IN DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE JOURNAL · doi:10.14201/adcaij2019848396 · Cited by 6
A clock-based dynamic logic for schedulability analysis of CCSL specifications
Zhang, Y., Mallet, F., Zhu, H., et al. (2020) · Science of Computer Programming · doi:10.1016/j.scico.2020.102546 · Cited by 6
History of Artificial Intelligence
O'Regan, G. (1977) · A Brief History of Computing · doi:10.1007/978-3-030-66599-9_22 · Cited by 387
Universal Neural Field Computation
Graben, P. B., & Potthast, R. (2014) · Springer eBooks · doi:10.1007/978-3-642-54593-1_11 · Cited by 7
Resource bounded immunity and simplicity
Yamakami, T., & Suzuki, T. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.03.055 · Cited by 7
Bhattacharya, S., Wang, Y., & Xu, D. (2010) · Minds and Machines · doi:10.1007/s11023-010-9198-7 · Cited by 7
“…(1964) claimed that a mind and a computer program could never be the one and the same because, following Gödel’s incompleteness theorems (Gödel 1931) it would always be possible to devise a number-theoretic formula whose proof would be apparent to a human programmer but would…”
BackgroundGödelization in the lambda calculus
Goldberg, M. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00071-5 · Cited by 6
Nicht-Standardmodelle der Zahlentheorie
M�ller, G. O. (1961) · Mathematische Zeitschrift · doi:10.1007/bf01180187 · Cited by 6
Kreppner, K. (1999) · Culture & Psychology · doi:10.1177/1354067x9952007 · Cited by 6
Rosén, R. (1985) · Springer eBooks · doi:10.1007/978-1-4613-2515-4_2 · Cited by 6
Hilbert’s Program: Incompleteness Theorems vs. Partial Realizations
Murawski, R. (1994) · Springer eBooks · doi:10.1007/978-94-015-8273-5_8 · Cited by 6
From Intentionality To Formal Semantics (From Twardowski To Tarski
Woleński, J. (2002) · Erkenntnis · doi:10.1023/a:1014767930388 · Cited by 6
Sard, A. (1982) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-7189-1_26 · Cited by 6
Rosser Provability and the Second Incompleteness Theorem
Kurahashi, T. (2021) · Springer proceedings in mathematics & statistics · doi:10.1007/978-981-16-4173-2_4 · Cited by 6
Computability and Enumerability
Soare, R. I. (1997) · Springer eBooks · doi:10.1007/978-94-017-0487-8_12 · Cited by 6
Sequence mapping in a three-dimensional space by a numeric method and some of its applications
Lareo, L., & Acevedo, O. E. (1999) · Acta Biotheoretica · doi:10.1023/a:1002018205360 · Cited by 6
Gödel's Second Theorem for Elementary arithmetic
Pozsgay, L. J. (1968) · Mathematical logic quarterly · doi:10.1002/malq.19680140106 · Cited by 6
Bounded arithmetic and computational complexity
Clote, P. (2002) · Structure in Complexity Theory Annual Conference · doi:10.1109/sct.1990.113967 · Cited by 6
Education, training and knowledge base design
Tompsett, C. (1988) · Expert Systems · doi:10.1111/j.1468-0394.1988.tb00347.x · Cited by 6
PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC
Gentilini, P., & Gentilini, P. (1992) · Mathematical logic quarterly · doi:10.1002/malq.19920380150 · Cited by 6
Unprovable combinatorial statements
Loebl, M. (1992) · Discrete Mathematics · doi:10.1016/0012-365x(92)90686-a · Cited by 6
Problemi aperti sulle algebre diagonali
Magari, R. (1974) · Rendiconti del Seminario Matematico e Fisico di Milano · doi:10.1007/bf02925653 · Cited by 6
Gibt es unentscheidbare Sätze?
Finsler, P. (1943) · Commentarii Mathematici Helvetici · doi:10.1007/bf02568583 · Cited by 6
Toward a formal analysis of cultural objects
Anderson, A. R., & Moore, O. K. (1962) · Synthese · doi:10.1007/bf00881991 · Cited by 6
Two questions on the geometry of gauge fields
da Costa, N. C. A., Dória, F. A., Furtado-do-Amaral, A. F., et al. (1994) · Foundations of Physics · doi:10.1007/bf02054673 · Cited by 6
Analogues of quantum complementarity in the theory of automata
Svozil, K. (1998) · Studies in History and Philosophy of Science Part B Studies in History and Philosophy of Modern Physics · doi:10.1016/s1355-2198(97)00028-2 · Cited by 6
The Nature of Fundamentals, Applied to the Fundamentals of Nature
Glanville, R. (1978) · Springer eBooks · doi:10.1007/978-1-4757-0555-3_30 · Cited by 6
Stoll, E. A. (2024) · Frontiers in Cognition · doi:10.3389/fcogn.2023.1171273 · Cited by 5
“As such, any logical system that evaluates both the internal consistency or "truth" of computable statements and the relationship of these statements to each other is necessarily incomplete (Gödel, 1931; Raatikainen, 2015).”
Biological arrow of time: emergence of tangled information hierarchies and self-modelling dynamics
Prokopenko, M., Davies, P. C. W., Harré, M., Heisler, M. G., Kuncic, Z., Lewis, G. F., Livson, O., Lizier, J. T., & Rosas, F. E. (2024) · Journal of Physics Complexity · doi:10.1088/2632-072x/ad9cdc · Cited by 19
Azadi, P. (2025) · Biosystems · doi:10.1016/j.biosystems.2025.105563 · Cited by 8
The Relativistic Kepler Problem and Gödel’s Paradox
Brändas, E. (2012) · Progress in theoretical chemistry and physics · doi:10.1007/978-94-007-5297-9_1 · Cited by 4
The rise of probabilistic thinking
von Plato, J. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.053 · Cited by 5
On constructivity and the Rosser property: a closer look at some Gödelean proofs
Salehi, S., & Seraji, P. (2018) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2018.04.009 · Cited by 5
“The following table summarizes some of the new and old results in this paper: Proof Constructive Rosser Property GÖDEL (1931) [6] X X [8] ROSSER (1936) [17] X X KLEENE1 (1936) [12] X X Theorem 2.3 KLEENE2 (1950) [13] X X CHAITIN (1971) [4] X [16, 23],Theorem 3.5 X Theorem 3.9 BOOLOS (1989) [2] X Theorem 4.5 X Theorem…”
InfluentialГипотеза Римана как чётность биномиальных коэффициентов
Матиясевич, Ю. В. (2019) · Чебышевский сборник · doi:10.22405/2226-8383-2018-19-3-46-60 · Cited by 5
Benzmüller, C., & Reiche, S. (2022) · Journal of Logic and Computation · doi:10.1093/logcom/exac029 · Cited by 5
Peled, D. (2019) · Springer eBooks · doi:10.1007/978-3-030-00262-6_5 · Cited by 5
Automated Reasoning for Mathematics
Avigad, J. D. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-63498-7_1 · Cited by 5
Taxonomy for physics beyond quantum mechanics
Adlam, E., Hance, J. R., Hossenfelder, S., & Palmer, T. N. (2024) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2023.0779 · Cited by 17
Another kind of authenticity: the visual simulacra of artificial intelligence
Jiang, S., & Kang-hua, L. (2025) · Digital Creativity · doi:10.1080/14626268.2025.2467087 · Cited by 6
The Rise and Development of Logical Semantics in Poland
Woleński, J. (2009) · Springer eBooks · doi:10.1007/978-90-481-2401-5_4 · Cited by 5
Cooper, S. B. (1999) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(99)80020-2 · Cited by 5
Submodels in Carnap’s Early Axiomatics Revisited
Loeb, I. (2013) · Erkenntnis · doi:10.1007/s10670-013-9501-0 · Cited by 5
Eberbach, E., & Mikkilineni, R. (2014) · IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE) · doi:10.1109/wetice.2014.24 · Cited by 6
The Mentor of Alan Turing: Max Newman (1897–1984) as a Logician
Grattan-Guinness, I. (2013) · The Mathematical Intelligencer · doi:10.1007/s00283-013-9387-3 · Cited by 5
On the Inherent Incompleteness of Scientific Theories
Mathen, J. (2011) · Activitas Nervosa Superior · doi:10.1007/bf03379933 · Cited by 6
von Müller, A. (2015) · On thinking · doi:10.1007/978-3-319-10446-1_1 · Cited by 5
Euchner, W. (2005) · Leviathan · doi:10.1007/s11578-005-0025-0 · Cited by 5
Chen, Y., & Flum, J. (2014) · Bulletin of Symbolic Logic · doi:10.1017/bsl.2013.2 · Cited by 5
“In his seminal paper [26], referring to Gödel’s publication [9], he writes: “By the correct application of one of these arguments, conclusions are reached which are superficially similar to those of Gödel.”
ResultOn Constructive Nilpotent Groups
Khisamiev, N. G., & Latkin, I. V. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-50062-1_21 · Cited by 5
Transformations in speculative philosophy
Bradley, J. F. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.036 · Cited by 5
Incorporating quotation and evaluation into Church's type theory
Farmer, W. M. (2018) · Information and Computation · doi:10.1016/j.ic.2018.03.001 · Cited by 5
Rejecting Semantic Truth: On the Significance of Neurath’s Syntacticism
Anderson, D. E. (2019) · Boston studies in the philosophy of science · doi:10.1007/978-3-030-02128-3_13 · Cited by 5
Firstness - As seen from the perspective of Complexity Research
Füllsack, M. (2011) · E-LOGOS · doi:10.18267/j.e-logos.298 · Cited by 5
Finitely axiomatized theories lack self‐comprehension
Pakhomov, F. N., & Visser, A. (2022) · Bulletin of the London Mathematical Society · doi:10.1112/blms.12708 · Cited by 5
Clark, K. B. (2021) · Behavioral and Brain Sciences · doi:10.1017/s0140525x21000078 · Cited by 5
Scalable Consensus Over Finite Capacities in Multiagent IoT Ecosystems
Anagnostakis, A. G., Naxakis, C., Γιαννακέας, Ν., et al. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3162103 · Cited by 5
Alasdair, U. (2009) · Handbook of the history of logic · doi:10.1016/s1874-5857(09)70016-0 · Cited by 5
Hardcastle, V. G. (1995) · Synthese · doi:10.1007/bf01063561 · Cited by 7
Moschovakis, Y. N. (2016) · Outstanding contributions to logic · doi:10.1007/978-3-319-41842-1_5 · Cited by 5
Implicit Definitions with Differential Equations for KeYmaera X
Gallicchio, J., Tan, Y. K., Mitsch, S., et al. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-10769-6_42 · Cited by 5
Zhang, W.-R. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00104-5 · Cited by 6
Epistemological scientism and the scientific meta-method
Turunen, P., Hirvonen, I., & Pättiniemi, I. (2023) · European Journal for Philosophy of Science · doi:10.1007/s13194-023-00526-9 · Cited by 10
Landauer’s Principle and Thermodynamics
Brändas, E. (2024) · Progress in theoretical chemistry and physics · doi:10.1007/978-3-031-52078-5_1 · Cited by 5
Rapidly Growing Ramsey Functions
Prömel, H. J. (2013) · Springer eBooks · doi:10.1007/978-3-319-01315-2_8 · Cited by 5
Theory of Knowing Machines: Revisiting Gödel and the Mechanistic Thesis
Aldini, A., Fano, V., & Graziani, P. (2016) · IFIP advances in information and communication technology · doi:10.1007/978-3-319-47286-7_4 · Cited by 5
Von Dedekind zu Zermelo versus Peano zu Gödel
Kähle, R. (2017) · Mathematische Semesterberichte · doi:10.1007/s00591-017-0193-4 · Cited by 5
Modlin, I. M., Kidd, M. S., Drozdov, I. A., & Bodei, L. (2019) · Neuroendocrinology · doi:10.1159/000504605 · Cited by 6
SET THEORY FROM CANTOR TO COHEN
Kanamori, A. (2009) · Elsevier eBooks · doi:10.1016/b978-0-444-51555-1.50014-6 · Cited by 5
Krömer, R. (2012) · Boston studies in the philosophy of science · doi:10.1007/978-94-007-2759-5_8 · Cited by 5
Philipse, H. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.040 · Cited by 5
Some aspects of categorical logic
Lambek, J. (1995) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(06)80039-x · Cited by 5
Die formalistisch-positivistische Doktrin der mathematischen Präzision im Lichte der Erfahrung
Kreisel, G. (1974) · Wissenschaft und Öffentlichkeit · doi:10.1007/978-3-642-80866-1_3 · Cited by 5
Hilbert's Programme and Gödel's Theorems
Niebergall, K.-G. (2002) · dialectica · doi:10.1111/j.1746-8361.2002.tb00250.x · Cited by 5
Proof-theoretical investigation of temporal logic with time gaps
Alonderis, R. (2000) · Lithuanian Mathematical Journal · doi:10.1007/bf02465129 · Cited by 5
Symbolic model checking of timed guarded commands using difference decision diagrams
Møller, J., Hulgaard, H., & Andersen, H. R. (2002) · The Journal of Logic and Algebraic Programming · doi:10.1016/s1567-8326(02)00023-1 · Cited by 5
Bulz, N., Stapleton, L., Lewoc, J. B., et al. (2009) · IFAC Proceedings Volumes · doi:10.3182/20091028-3-ro-4007.00019 · Cited by 5
A direct method for simulating partial recursive functions by Diophantine equations
Matiyasevich, Y. (1994) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(94)90014-0 · Cited by 5
Arbib, M. A. (1969) · Springer eBooks · doi:10.1007/978-3-642-87086-6_1 · Cited by 5
On Systems Software Engineering with Application to Bioinformatics
Huang, J. K. (2007) · IEEE International Conference on Granular Computing (GrC) · doi:10.1109/grc.2007.84 · Cited by 5
“An integrated ”Systems Software Engineering” theory based on Boolean logic and Hilbert logic [5,6] are proposed in this article.”
On the Physics and Mathematics of Thought
Penrose, R. (1995) · Computerkultur · doi:10.1007/978-3-7091-6597-3_22 · Cited by 5
Berkson, W. (1978) · PSA Proceedings of the Biennial Meeting of the Philosophy of Science Association · doi:10.1086/psaprocbienmeetp.1978.2.192474 · Cited by 5
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.