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 501–600 of 2,380
Necessary and Sufficient Conditions for Undecidability of the Gödel Sentence and its Truth
Isaacson, D. (2011) · The Western Ontario series in philosophy of science · doi:10.1007/978-94-007-0214-1_7 · Cited by 14
Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell
Tarau, P. (2009) · ACM Symposium on Applied Computing · doi:10.1145/1529282.1529706 · Cited by 14
“Ranking functions can be traced back to G¨odel number-ings [4, 6] associated to formulae.”
Chaotic neural nets, computability, and undecidability: Toward a computational dynamics
Basti, G., & Perrone, A. (1995) · International Journal of Intelligent Systems · doi:10.1002/int.4550100106 · Cited by 14
Can mathematics explain the evolution of human language?
Witzany, G. (2011) · Communicative & Integrative Biology · doi:10.4161/cib.16426 · Cited by 14
ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
Grabmayr, B. (2020) · The Review of Symbolic Logic · doi:10.1017/s1755020320000192 · Cited by 14
Efficient pairing functions-and why you should care
Rosenberg, A. L. (2002) · Proceedings - IEEE International Parallel and Distributed Processing Symposium · doi:10.1109/ipdps.2002.1016532 · Cited by 14
Brain, mind and limitations of a scientific theory of human consciousness
Gierer, A. (2008) · BioEssays · doi:10.1002/bies.20743 · Cited by 19
Reductions of Hilbert's tenth problem
Davis, M. D., & Putnam, H. (1958) · Journal of Symbolic Logic · doi:10.2307/2964397 · Cited by 14
“Then, using the Chinese remainder theorem, as in [2], we have (10) H(xv .”
MethodA computational approach to reflective meta-reasoning about languages with bindings
Nogin, A., Kopylov, A., Yu, X., & Hickey, J. J. (2005) · doi:10.1145/1088454.1088456 · Cited by 14
TRUTH, REFLECTION, AND HIERARCHIES
Glanzberg, M. (2005) · Synthese · doi:10.1007/s11229-005-3718-7 · Cited by 14
Number and Ascriptions of Number in Wittgenstein's Tractatus
Floyd, J. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0008 · Cited by 14
Short Course on Admissible Recursion Theory
Simpson, S. G. (1978) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70941-8 · Cited by 14
History and Future of Implicit and Inductionless Induction: Beware the Old Jade and the Zombie!
Wirth, C.-P. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-32254-2_12 · Cited by 14
Millar, T. S. (1999) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(99)80031-7 · Cited by 14
Svozil, K. (1995) · Foundations of Physics · doi:10.1007/bf02055507 · Cited by 19
A stuttering closed temporal logic for modular reasoning about concurrent programs
Mokkedem, A., & Méry, D. (2005) · Springer eBooks · doi:10.1007/bfb0014000 · Cited by 14
A metatheory of a mechanized object theory
Giunchiglia, F., & Traverso, P. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00002-x · Cited by 14
Separability, Contextuality, and the Quantum Frame Problem
Fields, C., & Glazebrook, J. F. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05406-9 · Cited by 15
Artificial Intelligence: Historical Context and State of the Art
Oliveira, A. L., & Figueiredo, M. A. T. (2023) · Law, governance and technology series · doi:10.1007/978-3-031-41264-6_1 · Cited by 18
Bakas, N., Papadaki, M., Vagianou, E., Christou, I. T., & Chatzichristofis, S. A. (2024) · Lecture notes in business information processing · doi:10.1007/978-3-031-56478-9_21 · Cited by 13
Towards A History of Cantor's Continuum Problem
Moore, G. M. (1989) · Elsevier eBooks · doi:10.1016/b978-0-12-599661-7.50011-2 · Cited by 13
The Comprehensibility Theorem and the Foundations of Artificial Intelligence
Charlesworth, A. (2014) · Minds and Machines · doi:10.1007/s11023-014-9349-3 · Cited by 13
“(The relevant definition of sound is in our section ‘‘Gödel’s Second Incompleteness Theorem is a Halting Problem Result’’.)”
BackgroundInfluentialArrows of time and fundamental symmetries in chemical physics
Brändas, E. (2012) · International Journal of Quantum Chemistry · doi:10.1002/qua.24168 · Cited by 15
Normativité et interdisciplinarité en aménagement-urbanisme
Martouzet, D. (2002) · Revue d’Économie Régionale & Urbaine · doi:10.3917/reru.024.0619 · Cited by 13
Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic
Steen, A., & Benzmüller, C. (2016) · Logic and Logical Philosophy · doi:10.12775/llp.2016.021 · Cited by 13
Self-Reference and the Incomplete Structure of Neoclassical Economics
Winrich, J. S. (1984) · Journal of Economic Issues · doi:10.1080/00213624.1984.11504303 · Cited by 13
Greiffenhagen, C., & Sharrock, W. (2019) · Human Studies · doi:10.1007/s10746-019-09509-3 · Cited by 20
“In contrast, Livingston studies a mathematical proof that was published many years ago (Gödel 1931) and that at the time of Livingston’s study was taught as in graduate or advanced undergraduate courses.”
BackgroundThe Fourier-Laplace Transform—A Conjugate Link Between the Material Brain and the Conscious Mind
Brändas, E. (2021) · Frontiers in Human Neuroscience · doi:10.3389/fnhum.2021.736761 · Cited by 13
“An interesting analogy, which will not be detailed here, is the mapping of Gödel’s celebrated link between model- and proof theory (Gödel, 1931), providing a logical table that translates a self-referential proposition into a Jordan block of linear algebra (Brändas, 2015).”
BackgroundA Family of Gödel Machine Implementations
Steunebrink, B. R., & Schmidhuber, J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22887-2_29 · Cited by 13
“The Defensible Province of Philosophy”: Quine's 1934 Lectures on Carnap
Hylton, P. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0012 · Cited by 14
A metasemantic challenge for mathematical determinacy
Warren, J., & Waxman, D. (2016) · Synthese · doi:10.1007/s11229-016-1266-y · Cited by 13
A geometrical and logical unification of mind, light and matter
Zhang, W.-R. (2016) · IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC) · doi:10.1109/icci-cc.2016.7862034 · Cited by 13
FINDING THE LIMIT OF INCOMPLETENESS I
Cheng, Y. (2020) · Bulletin of Symbolic Logic · doi:10.1017/bsl.2020.9 · Cited by 13
Why There is no General Solution to the Problem of Software Verification
Symons, J., & Horner, J. K. (2019) · Foundations of Science · doi:10.1007/s10699-019-09611-w · Cited by 13
Stannett, M. (2004) · Springer eBooks · doi:10.1007/978-3-662-05642-4_6 · Cited by 13
Humankind and the Environment: An Anatomy of Surprise and Ignorance
Faber, M., Manstetten, R., & Proops, J. L. R. (1992) · Environmental Values · doi:10.1177/096327199200100306 · Cited by 13
Rough Sets and Rough Logic: A KDD Perspective
Pawlak, Z., Polkowski, L., & Skowron, A. (2000) · Studies in fuzziness and soft computing · doi:10.1007/978-3-7908-1840-6_13 · Cited by 15
Gödel Machines: Towards a Technical Justification of Consciousness
Schmidhuber, J. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-32274-0_1 · Cited by 19
“Our machine becomes a self-referential [10] Gödel machine by loading it with a particular form of machine-dependent, self-modifying code p.”
BackgroundInfluentialAccelerating machines: a review
Fraser, R., & Akl, S. G. (2008) · International Journal of Parallel Emergent and Distributed Systems · doi:10.1080/17445760701536068 · Cited by 14
Emil Post and His Anticipation of Gödel and Turing
Stillwell, J. (2004) · Mathematics Magazine · doi:10.1080/0025570x.2004.11953222 · Cited by 13
On the Kind of Data Needed for A Theory of Proofs
Kreisel, G. (1977) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70422-7 · Cited by 13
Ramsey quantifiers in arithmetic
Macintyre, A. J. (1980) · Lecture notes in mathematics · doi:10.1007/bfb0090167 · Cited by 13
Meaning Networks and Verbal Communication: A Semiotic Perspective of Human Discourse
Danesi, M. (2001) · Springer eBooks · doi:10.1007/978-1-4615-1313-1_14 · Cited by 13
Computation Paradigms in Light of Hilbert's Tenth Problem
Matiyasevich, Y. (2007) · Springer eBooks · doi:10.1007/978-0-387-68546-5_4 · Cited by 13
Shapiro, S. C. (1995) · Minds and Machines · doi:10.1007/bf00974982 · Cited by 13
Skizze einer semiotischen Theorie des Lernens
Hoffmann, M. H. G. (2001) · Journal für Mathematik-Didaktik · doi:10.1007/bf03338937 · Cited by 13
Intuitionist type theory and foundations
Lambek, J., & Scott, P. J. (1981) · Journal of Philosophical Logic · doi:10.1007/bf00253914 · Cited by 13
Origins of recursive function theory
Kleene, S. C. (1979) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1979.33 · Cited by 17
Three coordinate systems for information science approaches
Kitagawa, T. (1973) · Information Sciences · doi:10.1016/0020-0255(73)90010-8 · Cited by 13
Nguyen, M.-H., & Ho, M.-T. (2026) · MethodsX · doi:10.1016/j.mex.2026.103910 · Cited by 21
Організація фрактального моделювання
Bolshakov, V. I., Volchuk, V. M., & Dubrov, Y. I. (2018) · Reports of the National Academy of Sciences of Ukraine · doi:10.15407/dopovidi2018.06.067 · Cited by 12
Digital Humanism and the Limits of Artificial Intelligence
Nida‐Rümelin, J. (2021) · Springer eBooks · doi:10.1007/978-3-030-86144-5_10 · Cited by 13
Jacques Herbrand: Life, Logic, and Automated Deduction
Wirth, C.-P., Siekmann, J. H., Benzmüller, C., & Autexier, S. (2009) · Handbook of the history of logic · doi:10.1016/s1874-5857(09)70009-3 · Cited by 14
Anticipation and Computation: Is Anticipatory Computing Possible?
Nadin, M. (2015) · Cognitive systems monographs · doi:10.1007/978-3-319-22599-9_18 · Cited by 16
Steen, A., Wisniewski, M., & Benzmüller, C. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-42432-3_10 · Cited by 12
Semiotics is Fundamental Science
Nadin, M. (2014) · Advances in knowledge acquisition, transfer, and management book series/Advances in knowledge acquisition, transfer and management book series · doi:10.4018/978-1-4666-4711-4.ch005 · Cited by 13
Gödel vis-à-vis Russell: Logic and set Theory to Philosophy
Floyd, J., & Kanamori, A. (2016) · Presses universitaires de Provence eBooks · doi:10.4000/books.pup.53640 · Cited by 20
Epistemic Horizons and the Foundations of Quantum Mechanics
Szangolies, J. (2018) · Foundations of Physics · doi:10.1007/s10701-018-0221-9 · Cited by 21
Clark, K. B. (2019) · Behavioral and Brain Sciences · doi:10.1017/s0140525x1800184x · Cited by 12
A note on derivability conditions
Kurahashi, T., 倉橋, 太., & クラハシ, タ. (2020) · Institutional Repositories DataBase (IRDB) · Cited by 12
Therapeutic Basis of Electromagnetic Resonances and Signal-Modulation
Szász, A. (2021) · Open Journal of Biophysics · doi:10.4236/ojbiphy.2021.113011 · Cited by 12
Shapiro, S., & Kissel, T. K. (2022) · Cambridge University Press eBooks · doi:10.1017/9781108982009 · Cited by 12
Automated Search for Gödel’s Proofs
Sieg, W., & Field, C. (2008) · Springer eBooks · doi:10.1007/978-88-470-0784-0_7 · Cited by 12
TWO (OR THREE) NOTIONS OF FINITISM
Ganea, M. (2010) · The Review of Symbolic Logic · doi:10.1017/s1755020309990323 · Cited by 12
“Skolem did not provide an axiomatic framework for his proofs of the theorems in question; this was supplied in Hilbert & Bernays (1934) after primitive recursive functions had been given their standard definition and used extensively in the arithmetization of syntax in Gödel (1931).”
MethodMulligan, R. F. (2006) · The Review of Austrian Economics · doi:10.1007/s11138-006-9251-1 · Cited by 13
STRONG COMPLETENESS OF PROVABILITY LOGIC FOR ORDINAL SPACES
Aguilera, J. P., & Fernández–Duque, D. (2017) · Journal of Symbolic Logic · doi:10.1017/jsl.2017.3 · Cited by 12
“The study of formalized provability can be traced back to the seminal 1931 paper by Kurt Gödel [11], where he first showed how any mathematical theory that is able to describe the arithmetic of natural numbers, such as Peano Arithmetic (PA), also possesses the expressive power to reason about provability within said t…”
BackgroundClustering: how much bias do we need?
Lorimer, T., Held, J., & Stoop, R. (2017) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2016.0293 · Cited by 13
Big Data and Transport Analytics: An Introduction
Antoniou, C., Dimitriou, L., & Pereira, F. C. (2018) · Elsevier eBooks · doi:10.1016/b978-0-12-812970-8.00001-4 · Cited by 12
Warren, J. (2020) · Philosophy and Phenomenological Research · doi:10.1111/phpr.12694 · Cited by 14
O’Regan, G. (2012) · Springer eBooks · doi:10.1007/978-1-4471-2359-0_15 · Cited by 13
David Hilbert and Paul Bernays, Grundlagen der mathematik, first edition (1934, 1939)
Sieg, W., & Ravaglia, M. (2005) · Elsevier eBooks · doi:10.1016/b978-044450871-3/50158-3 · Cited by 12
Hierarchical representation of legal knowledge with metaprogramming in logic
Barklund, J., & Hamfelt, A. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90041-8 · Cited by 12
Economics as mechanism: The mind as machine in Hayek's sensory order
Tuerck, D. G. (1995) · Constitutional Political Economy · doi:10.1007/bf01303407 · Cited by 12
The "Natural" and the "Formal"
Peregrin, J. (2000) · Journal of Philosophical Logic · doi:10.1023/a:1004781713292 · Cited by 12
The Popper/Kuhn debate: truth and two faces of relativism
Notturno, M. A. (1984) · Psychological Medicine · doi:10.1017/s003329170000355x · Cited by 12
Definable naming relations in meta-level systems
van Harmelen, F. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56282-6_6 · Cited by 12
The Roles of Necessity in Biology
Rosén, R. (1989) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4684-0553-8_2 · Cited by 12
Algorithmically unsolvable problems for a cell automaton
Stahl, W. R. (1965) · Journal of Theoretical Biology · doi:10.1016/0022-5193(65)90017-2 · Cited by 12
An introduction to hyperarithmetical functions
Robinson, J. (1967) · Journal of Symbolic Logic · doi:10.2307/2270774 · Cited by 12
AUTOMATA THEORY IN THE CONTEXT OF THEORETICAL NEUROPHYSIOLOGY
Arbib, M. A. (1973) · Elsevier eBooks · doi:10.1016/b978-0-12-597203-1.50012-9 · Cited by 11
Hierarchical meta-logics: Intuitions, proof theory and semantics
Giunchiglia, F., Serafini, L., & Simpson, A. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56282-6_16 · Cited by 12
Edwards, D. J. (2023) · Frontiers in Psychology · doi:10.3389/fpsyg.2023.1150743 · Cited by 13
“…books I am Strange Loop and Gödel, Escher, Bach: An Eternal Golden Braid (Hofstadter, 1979, 2007), referred to the properties of self-referential systems as demonstrated in Gödel’s incompleteness theorems (Gödel, 1931) and other areas as leading to paradoxes, which he refers to as strange loops.”
BackgroundThe role of quantum mechanics in cognition-based evolution
Marshall, P. (2023) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2023.04.007 · Cited by 11
The importance of multimedia principle and emergence principle for the knowledge civilisation age
Wierzbicki, A. P., & Nakamori, Y. (2008) · Journal of Systems Science and Systems Engineering · doi:10.1007/s11518-008-5071-0 · Cited by 11
Teoria i praktyka wspomagania decyzji
Wierzbicki, A. P. (2018) · Wydawnictwa Uniwersytetu Warszawskiego eBooks · doi:10.31338/uw.9788323533610 · Cited by 11
Reflexive structure of the conscious subject and the origin of language codes
Igamberdiev, A. U. (2023) · Biosystems · doi:10.1016/j.biosystems.2023.104983 · Cited by 12
Brändas, E. (2015) · Progress in theoretical chemistry and physics · doi:10.1007/978-3-319-14397-2_14 · Cited by 11
When is scalar multiplication decidable?
Hieronymi, P. (2019) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2019.05.001 · Cited by 11
“However, a consequence of Gödel’s famous first incompleteness theorem [5] states that when expanding (R, <,+,Z) by a symbol for multiplication on R, the theory of the resulting structure (R, <,+, ·,Z) becomes undecidable.”
BackgroundA Collaborative Framework for Non-Linear Integer Arithmetic Reasoning in Alt-Ergo
Conchon, S., Iguernelala, M., & Mebsout, A. (2013) · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) · doi:10.1109/synasc.2013.29 · Cited by 11
“While there exists a large panel of work on NRA, only very few incomplete methods exist for NIA.”
Border Zones of Ecology and Systems Theory
Becker, E., & Breckling, B. (2011) · Springer eBooks · doi:10.1007/978-90-481-9744-6_27 · Cited by 11
Henkin sentences and local reflection principles for Rosser provability
Kurahashi, T. (2015) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2015.10.002 · Cited by 11
Neo-Kantianism: the German idealism movement
Adair‐Toteff, C. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.004 · Cited by 16
GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑n-DEFINABLE THEORIES OF ARITHMETIC
KIKUCHI, M., & Kurahashi, T. (2017) · The Review of Symbolic Logic · doi:10.1017/s1755020317000235 · Cited by 11
Picollo, L. (2018) · The Review of Symbolic Logic · doi:10.1017/s1755020317000351 · Cited by 15
MATHEMATICAL INFERENCE AND LOGICAL INFERENCE
Hamami, Y. (2018) · The Review of Symbolic Logic · doi:10.1017/s1755020317000326 · Cited by 11
Yanai, I., & Lercher, M. J. (2019) · Genome biology · doi:10.1186/s13059-019-1902-1 · Cited by 11
Chen, M., & Edwards, D. J. (2020) · Springer eBooks · doi:10.1007/978-3-030-34444-3_11 · Cited by 10
“Penrose then offered a proof for the postulation [49]: “Human mathematicians are not using a knowably sound algorithm in order to ascertain mathematical truth.” by following the reasoning strategy that Gödel used to prove his Incompleteness Theorems [28, 7], and Turing used to prove his theorem on the Halting Problem…”
MethodAutomated search for Gödel’s proofs
Sieg, W., & Field, C. (2004) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2004.10.014 · Cited by 11
Popp, J., & Biskup, T. (2022) · Chemistry - Methods · doi:10.1002/cmtd.202100097 · Cited by 12
Complexity and Emergence in Engineering Systems
Chen, C., Nagl, S., & Clack, C. D. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-88075-2_5 · Cited by 14
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.