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 901–1,000 of 2,380
Shapiro, S. (2009) · Oxford University Press eBooks · doi:10.1093/oxfordhb/9780195325928.003.0025 · Cited by 5
Non‐Negotiable Demands: Metaphysics, Politics, and the Discourse of Needs
Scheman, N. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0015 · Cited by 5
Hans Reichenbach: Realist and Verificationist
Putnam, H. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0013 · Cited by 5
The AI Wars, 1950–2000, and Their Consequences
Dietrich, E., Fields, C., Sullins, J. P., Heuveln, B. V., & Zebrowski, R. L. (2021) · Journal of Artificial Intelligence and Consciousness · doi:10.1142/s2705078521300012 · Cited by 6
Correctness of on-line partial evaluation for a Pascal-like language
Meyer, U. (1999) · Science of Computer Programming · doi:10.1016/s0167-6423(98)00015-x · Cited by 5
Rum an intensional theory of function and control abstractions
Talcott, C. (1988) · Lecture notes in computer science · doi:10.1007/3-540-19129-1_1 · Cited by 5
Metamathematische Begriffe in Standardtheorien
Germano, G. (1970) · Archive for Mathematical Logic · doi:10.1007/bf01967648 · Cited by 5
Gödel’s Incompleteness Theorem
Arbib, M. A. (1987) · Springer eBooks · doi:10.1007/978-1-4612-4782-1_8 · Cited by 5
An arithmetical reconstruction of the liar's antinomy using addition and multiplication.
Germano, G. (1976) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093887641 · Cited by 5
“Note that the above notion of definability is weaker (and therefore more general) than that of Gδdel [2] and Tarski [4], provided Y is consistent.”
ResultEin Satz über die Elementar-Arithmetischen Definierbarkeitsklassen
Markwald, W. (1956) · Archive for Mathematical Logic · doi:10.1007/bf01969993 · Cited by 5
A multicontext architecture for formalizing complex reasoning
Giunchiglia, E., & Traverso, P. (1995) · International Journal of Intelligent Systems · doi:10.1002/int.4550100504 · Cited by 5
FIFTEEN POSSIBLE PREVIEWS IN EQUATIONAL LOGIC
McNulty, G. F. (1986) · Elsevier eBooks · doi:10.1016/b978-0-444-87759-8.50025-0 · Cited by 5
AI Powered SocietyPreprint
Bera, R. K. (2018) · SSRN Electronic Journal · doi:10.2139/ssrn.3256873 · Cited by 5
Svozil, K. (1995) · Foundations of Physics Letters · doi:10.1007/bf02186244 · Cited by 5
Prädikatenlogik mit partiell definierten Funktionen
Markwald, W. (1971) · Archive for Mathematical Logic · doi:10.1007/bf01974146 · Cited by 5
Can quantum gravity be both consistent and complete?
Faizal, M., Krauss, L. M., Shabir, A., Marino, F., & Pourhassan, B. (2025) · International Journal of Modern Physics D · doi:10.1142/s0218271825440171 · Cited by 7
A Paradigm Shift in Cognitive Sciences?
Knyazev, G. G. (2023) · Neuroscience and Behavioral Physiology · doi:10.1007/s11055-023-01483-9 · Cited by 6
Complexity, Artificial Life, and Artificial Intelligence
Gershenson, C. (2024) · Artificial Life · doi:10.1162/artl_a_00462 · Cited by 6
Chaitin’s Omega and an algorithmic phase transition
Schmidhuber, C. (2021) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2021.126458 · Cited by 4
The difference between neuroscience and psychoanalysis: Irreducibility of absence to brain states
Last, C. (2021) · Neuropsychoanalysis · doi:10.1080/15294145.2021.1926312 · Cited by 6
Zardini, E. (2022) · Journal of Philosophical Logic · doi:10.1007/s10992-022-09682-4 · Cited by 4
Martín, K. G. (2022) · HUMAN REVIEW International Humanities Review / Revista Internacional de Humanidades · doi:10.37467/revhuman.v11.4503 · Cited by 4
Dick, S. (2023) · Osiris · doi:10.1086/725135 · Cited by 4
Causal Capabilities of Teleology and Teleonomy in Life and Evolution
Bartlett, J. (2023) · Organon F · doi:10.31577/orgf.2023.30301 · Cited by 4
Notes on Gödel’s and Scott’s variants of the ontological argument
Benzmüller, C., & Scott, D. (2025) · Monatshefte für Mathematik · doi:10.1007/s00605-025-02078-x · Cited by 4
Application of Chaitin’s Incompleteness Theorem to Quantum Gravity
Faizal, M., Shabir, A., & Khan, A. K. (2025) · International Journal of Theoretical Physics · doi:10.1007/s10773-025-06065-8 · Cited by 4
Some Biochemical Reflections on Information and Communication
Brändas, E. (2013) · Progress in theoretical chemistry and physics · doi:10.1007/978-3-319-01529-3_4 · Cited by 4
From epistemology toGnoseology: Foundations of the knowledge industry
Alonso-Amo, F., Maté, J. L., Morant, J. L., et al. (1992) · AI & Society · doi:10.1007/bf02472778 · Cited by 4
Memetic Communication Media - Concepts, Technologies, Applications
Jantke, K. P., Fujima, J., Arnold, O., et al. (2012) · IEEE International Conference on Multimedia and Expo workshops · doi:10.1109/icmew.2012.51 · Cited by 4
“For the purpose of the research and the applications in higher education (see [8] for more details), the authors have selected the recursive functions approach originating from [23] and [19] (see also [13]).”
BackgroundFriedberg Numbering in Fragments of Peano Arithmetic andα-Recursion Theory
Li, W. (2013) · Journal of Symbolic Logic · doi:10.2178/jsl.7804060 · Cited by 4
Remarks on Simon Susen’s The “Postmodern Turn” in the Social Sciences
Outhwaite, W. (2016) · International Journal of Politics Culture and Society · doi:10.1007/s10767-016-9229-3 · Cited by 4
Turing and the discovery of computability
Soare, R. I. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781107338579.014 · Cited by 6
Nafría, J. M. D. (2011) · IGI Global eBooks · doi:10.4018/978-1-61350-201-3.ch003 · Cited by 4
Metaphysics and mathematics: Perspectives on reality
Kühn, G. J. (2017) · HTS Teologiese Studies / Theological Studies · doi:10.4102/hts.v73i3.4663 · Cited by 4
“It came as a shock to Hilbert when Kurt Gödel (1906–1978), an Austrian, later American, logician, mathematician and philosopher published a paper in 1931 showing that such a set of axioms from which all theorems about the natural numbers can be proven did not exist (Gödel 1931).”
BackgroundFootprints of General Systems Theory
Malecic, A. (2017) · Systems Research and Behavioral Science · doi:10.1002/sres.2484 · Cited by 4
Rodríguez, R. A., Duncan, J. M., Delgado, J. D., Vanni, M. J., Riera, R., Herrera, A. M., & González, M. J. (2017) · Ecological Modelling · doi:10.1016/j.ecolmodel.2017.08.019 · Cited by 4
Empowering Cognition by Precisation of Numeric Words
Fiorini, R. A. (2017) · International Journal of Software Science and Computational Intelligence · doi:10.4018/ijssci.2017100101 · Cited by 4
Synthetic Biology, Artificial Intelligence, and Quantum Computing
Bera, R. K. (2019) · IntechOpen eBooks · doi:10.5772/intechopen.83434 · Cited by 4
Delegated causality of complex systems
Vidunas, R. (2019) · MPG.PuRe (Max Planck Society) · Cited by 4
A clock-based dynamic logic for the verification of CCSL specifications in synchronous systems
Zhang, Y., Wu, H., Chen, Y., et al. (2020) · Science of Computer Programming · doi:10.1016/j.scico.2020.102591 · Cited by 4
The scientific status of geometric models of choice and similarities judgment
Poole, K. T. (2017) · Public Choice · doi:10.1007/s11127-017-0443-y · Cited by 4
Rauter, H. (2021) · The urban book series · doi:10.1007/978-3-030-80165-6_2 · Cited by 4
Feferman, S. (1995) · Computerkultur · doi:10.1007/978-3-7091-6597-3_4 · Cited by 4
The Common Logic of Quantum Universe—Part II: The Case of Quantum Gravity
Tessarotto, M., & Cremaschini, C. (2022) · Foundations of Physics · doi:10.1007/s10701-022-00548-y · Cited by 5
“Hence, to adopt an analogue of Kurt Gödel’s language [34], its quantum measurement cannot be either true or false, thus remaining undecidable.”
BackgroundBibel, W. (2022) · Informatik-Spektrum · doi:10.1007/s00287-022-01456-1 · Cited by 4
Wittgenstein, Russell, and Our Concept of the Natural Numbers
Kripke, S. A. (2023) · Jerusalem studies in philosophy and history of science · doi:10.1007/978-3-031-21655-8_8 · Cited by 4
ON THE HIERARCHY OF NATURAL THEORIES
WALSH, J. (2025) · Bulletin of Symbolic Logic · doi:10.1017/bsl.2025.10137 · Cited by 4
Hilbert's axiomatic method and Carnap's general axiomatics
Stöltzner, M. (2015) · Studies in History and Philosophy of Science Part A · doi:10.1016/j.shpsa.2015.05.005 · Cited by 4
Ramsey and the Vienna Circle on Logicism
Köhler, E. (2006) · Springer eBooks · doi:10.1007/1-4020-4101-2_7 · Cited by 4
Rudolf Carnap, 1891?1970: The editor's introduction
Sarkar, S. (1992) · Synthese · doi:10.1007/bf00869419 · Cited by 4
The Need for a Non-computational Extension of Quantum Action in the Brain
Penrose, R. (1997) · Springer eBooks · doi:10.1007/978-3-642-60570-3_2 · Cited by 4
On the Arithmetical Truth of Self‐Referential Sentences
Lajevardi, K., & Salehi, S. (2018) · Theoria · doi:10.1111/theo.12169 · Cited by 4
Mining HCI Data for Theory of Mind Induction
Arnold, O., & Jantke, K. P. (2018) · InTech eBooks · doi:10.5772/intechopen.74400 · Cited by 4
ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP
Salehi, S. (2020) · Bulletin of Symbolic Logic · doi:10.1017/bsl.2019.58 · Cited by 4
Bourdillon, A. J. (2020) · Journal of Modern Physics · doi:10.4236/jmp.2020.1112121 · Cited by 4
Pelham, J., & Urquhart, A. (1995) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(06)80050-9 · Cited by 4
Comets, Information, and the Origin of Life
Sheldon, R. B. (2012) · Cellular origin and life in extreme habitats · doi:10.1007/978-94-007-2941-4_21 · Cited by 4
Fenstad, J. E., & Wang, H. (2009) · Handbook of the history of logic · doi:10.1016/s1874-5857(09)70008-1 · Cited by 4
Timed Verification of Asynchronous Circuits
Møller, J. B., Hulgaard, H., & Andersen, H. R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36190-1_8 · Cited by 4
Incomputability, Emergence and the Turing Universe
Cooper, S. B. (2009) · Springer eBooks · doi:10.1007/978-90-481-3529-5_8 · Cited by 4
“Turing shows that despite Gödel’s proof [21] that no consistent first-order theory captures arithmetic, we can hierarchically transcend this barrier, in a quite constructive way – one just iterates the Gödel argument, computably generating new unprovable theorems which are then used to enlarge the theory.”
BackgroundWhy Is the Lucas-Penrose Argument Invalid?
Kerber, M. (2005) · Lecture notes in computer science · doi:10.1007/11551263_30 · Cited by 4
From Mirror Writing to Mirror Neurons
Arbib, M. A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15193-4_1 · Cited by 4
Addressing New Challenges by Building Security Protocols Around Graphs
Kulesza, K., & Kotulski, Z. (2005) · Lecture notes in computer science · doi:10.1007/11542322_36 · Cited by 4
Church’s Lambda Delta Calculus
Statman, R. (2007) · Lecture Notes in Artificial Intelligence · doi:10.1007/3-540-44404-1_19 · Cited by 4
“G¨ odel’s famous observation [ 4 ] that the consistency of nth order arithmetic can be proved in n + 1th order shows that this corollary does not extend to larger values of n.”
BackgroundCompactness Properties for Stable Semantics of Logic Programs
Marek, V. W., & Remmel, J. B. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72734-7_27 · Cited by 4
Is There a Link Between Quantum Mechanics and Consciousness?
Ward, B. K. (2014) · History, philosophy and theory of the life sciences · doi:10.1007/978-94-017-8774-1_15 · Cited by 6
“69 Godel 1931 .”
A Type of Partial Recursive Functions
Bove, A., & Capretta, V. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-71067-7_12 · Cited by 4
“Kurt G¨ odel devised a system to encode expressions of a formal language into natural numbers by exploiting the uniqueness of prime factorisation [ 16 ].”
Cafezeiro, I. L., Gadelha, C., Chaitin, V. M. F. G., et al. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-07233-3_6 · Cited by 4
Fast growing functions based on Ramsey theorems
Prömel, H. J., & Thumser, W. (1991) · Discrete Mathematics · doi:10.1016/0012-365x(91)90346-4 · Cited by 4
Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
Matiyasevich, Y. (2004) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2004.05.013 · Cited by 4
On the correctness of imprecision and the existential fallacy of absolute music
Wiggins, G. A. (2012) · Journal of Mathematics and Music · doi:10.1080/17459737.2012.697274 · Cited by 4
Évaluation des psychothérapies : réflexions épistémologiques
Gadeau, L. (2006) · Le Journal des psychologues · doi:10.3917/jdp.242.0056 · Cited by 4
Numbers as Moments of Multisets: A New-Old Formulation of Arithmetic
Grattan-Guinness, I. (2011) · The Mathematical Intelligencer · doi:10.1007/s00283-010-9176-1 · Cited by 4
On the Equivalence Between Logic‐Free and Logic‐Bearing Systems of Primitive Recursive Arithmetic
Schwartz, D. G. (1987) · Mathematical logic quarterly · doi:10.1002/malq.19870330308 · Cited by 4
On ω-inconsistency and a so-called axiom of infinity
Quine, W. V. (1953) · Journal of Symbolic Logic · doi:10.2307/2268944 · Cited by 4
Reflections on the Categorical Foundations of Mathematics
Lambek, J., & Scott, P. J. (2011) · The Western Ontario series in philosophy of science · doi:10.1007/978-94-007-0431-2_9 · Cited by 4
Non-standard numbers: a semantic obstacle for modelling arithmetical reasoning
Araujo, A. D., & Carnielli, W. A. (2010) · Logic Journal of IGPL · doi:10.1093/jigpal/jzq051 · Cited by 4
“Unfortunately, due to Gödel’s work [8], we found out that it is impossible to give a complete logical formalization of the whole arithmetic involved in our arithmetical reasoning (Gödel’s first incompleteness theorem).”
BackgroundHatfield, G. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.055 · Cited by 4
Theories, theoretical models, truth
Wójcicki, R. (1995) · Foundations of Science · doi:10.1007/bf00125783 · Cited by 4
On Computable Numbers, with an Application to the Entscheidungsproblem – A Correction
Cooper, S. B., & Leeuwen, J. V. (2013) · Elsevier eBooks · doi:10.1016/b978-0-12-386980-7.50002-2 · Cited by 4
Diagonalization in Logic and Mathematics
Jacquette, D. (2002) · Springer eBooks · doi:10.1007/978-94-017-0466-3_2 · Cited by 4
On computable numbers with an application to the AlanTuringproblem
Huws, C. F., & Finnis, J. C. (2017) · Artificial Intelligence and Law · doi:10.1007/s10506-017-9200-2 · Cited by 4
de Sojo, Á. A., Lara, J. A., Lizcano, D., Martínez, M.-A., Pazos, J., & Esteban, F. D. D. L. P. (2019) · Foundations of Science · doi:10.1007/s10699-019-09596-6 · Cited by 4
Metalogic, Schopenhauer and Universal Logic
Béziau, J.-Y. (2020) · Studies in universal logic · doi:10.1007/978-3-030-33090-3_13 · Cited by 4
Wybraniec-Skardowska, U. (2008) · Springer eBooks · doi:10.1007/978-1-4020-9084-4_16 · Cited by 4
Martin, M. G. F. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.044 · Cited by 5
Arbib, M. A. (1987) · Springer eBooks · doi:10.1007/978-1-4612-4782-1_1 · Cited by 4
Nadin, M. (2006) · Springer eBooks · doi:10.1007/3-540-28611-x_2 · Cited by 6
Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices
Tarau, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-20615-8_8 · Cited by 4
On Undecidability Aspects of Resilient Computations and Implications to Exascale
Rao, N. S. V. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-14325-5_44 · Cited by 4
Computing and Complexity — Networks, Nature and Virtual Worlds
Green, D. G., & Leishman, T. G. (2011) · Elsevier eBooks · doi:10.1016/b978-0-444-52076-0.50004-3 · Cited by 4
On the independence of definitions of finiteness in a system of logic
Mostowski, A. W. (1979) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70245-9 · Cited by 4
Hans Hahn and the Foundational Debate
Sigmund, K. (1995) · Springer eBooks · doi:10.1007/978-94-017-3327-4_18 · Cited by 4
Embedding hardware verification within a commercial design framework
Kröpf, T., Kumar, R., & Schneider, K. (2005) · Springer eBooks · doi:10.1007/bfb0021728 · Cited by 4
A setting for generalized computability
Germano, G., & Mazzanti, S. (1987) · Lecture notes in computer science · doi:10.1007/3-540-18170-9_163 · Cited by 4
Different Theoretical Differences and Contextual Influences
Draghi‐Lorenz, R. (2010) · doi:10.1002/9780470667279.ch7 · Cited by 4
Coarse Graining Revisited — The Case of Macroscopic Chaos
Tomita, K. (1984) · Springer series in synergetics · doi:10.1007/978-3-642-69559-9_1 · Cited by 4
Closure functions and general iterates as reflectors
Germano, G., & Mazzanti, S. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(91)90223-o · Cited by 4
Extensions of the Finitist Point of View
Schirn, M., & Niebergall, K.-G. (2001) · History and Philosophy of Logic · doi:10.1080/01445340210154295 · Cited by 4
Aspects of a theory of systemic construction
Bulz, N. (2005) · Kybernetes · doi:10.1108/03684920510614849 · Cited by 4
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.