Ü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 1,001–1,100 of 2,380
Helrich, C. S. (2006) · Zygon® · doi:10.1111/j.1467-9744.2005.00757.x · Cited by 5
A Decidable Fragment of Recursive Arithmetic
Goodstein, R. L. (1963) · Mathematical logic quarterly · doi:10.1002/malq.19630091203 · Cited by 4
Constructibility as a criterion for existence
Rosser, B. (1936) · Journal of Symbolic Logic · doi:10.2307/2269325 · Cited by 4
On the origin of irreversibility in classical electrodynamic measurement processes
Leiter, D. (1984) · Foundations of Physics · doi:10.1007/bf00737553 · Cited by 4
Comments on "Correction of Maxwell's equations for signals I and II" (by R.J. Mohr)
Rosich, R. K., & Mohr, R. J. (1988) · IEEE Transactions on Electromagnetic Compatibility · doi:10.1109/15.2406 · Cited by 4
Rigidity and definability in the noncomputable universe
Cooper, S. B. (1995) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(06)80046-7 · Cited by 4
The incompleteness of ethogenics
Totman, R. (1980) · European Journal of Social Psychology · doi:10.1002/ejsp.2420100103 · Cited by 4
Bemerkungen zum Begriff der inhaltlichen Widerspruchsfreiheit
Mostowski, A. W. (1939) · Journal of Symbolic Logic · doi:10.2307/2266445 · Cited by 4
The long-term future of the universe
Islam, J. N. (1979) · Vistas in Astronomy · doi:10.1016/0083-6656(79)90014-x · Cited by 4
Aggregation and Desaggregation of Information as an Adaptive TaskPreprint
Bulz, N. (2011) · SSRN Electronic Journal · doi:10.2139/ssrn.1743120 · Cited by 4
Undecidability and Quantum Mechanics
Noce, C., & Romano, A. (2022) · Encyclopedia · doi:10.3390/encyclopedia2030103 · Cited by 4
Müller, V. C. (2025) · Wiley eBooks · doi:10.1002/9781394238651.ch2 · Cited by 7
Formalisation and Meta-Theory of Type Theory
Winterhalter, T. (2020) · doi:10.70675/f3c96514z4373z4f99z8b3fzb1b41307d558 · Cited by 4
Tarau, P. (2012) · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) · doi:10.1109/synasc.2012.19 · Cited by 3
“…numbers N as the hub through which various data types are isomorphically connected, one rediscovers that these are just Gödel numberings - with the important addition that they are bijective, rather than injective only, as originally introduced in the proof of the incompleteness theorems [4].”
BackgroundConjugacy class numbers and π-subgroups
Malle, G., Navarro, G., & Robinson, G. R. (2021) · Pacific Journal of Mathematics · doi:10.2140/pjm.2021.311.135 · Cited by 3
The Executioner Paradox: understanding self-referential dilemma in computational systems
Mahajan, S. (2024) · AI & Society · doi:10.1007/s00146-024-01968-2 · Cited by 3
Evaluating the explanatory power of the Conscious Turing Machine
Kirkeby-Hinrup, A., Stenseke, J., & Overgaard, M. S. (2024) · Consciousness and Cognition · doi:10.1016/j.concog.2024.103736 · Cited by 4
Warum braucht die Logik eine Theorie der Erfahrung
Lohmar, D. (2000) · Contributions to phenomenology · doi:10.1007/978-94-015-9446-2_10 · Cited by 3
Mathesis Universalis and the Life-World: Finitude and Responsibility
Rizo-Patrón, R. (2014) · Contributions to phenomenology · doi:10.1007/978-3-319-09828-9_10 · Cited by 3
Whitehead and the Implications of the Process Metaphor for Mathematics
Ernest, P. (2000) · Interchange · doi:10.1023/a:1026779831807 · Cited by 3
On Some Properties of Humanly Known and Humanly Knowable Mathematics
Megill, J. L., Melvin, T., & Beal, A. (2013) · Axiomathes · doi:10.1007/s10516-013-9211-x · Cited by 3
The need for a new model of trust in spectrum and the case for spectrum jails
Woyach, K. A., & Sahai, A. (2014) · IEEE International Symposium on Dynamic Spectrum Access Networks · doi:10.1109/dyspan.2014.6817826 · Cited by 4
Towards transfinite type theory: rereading Tarski’s Wahrheitsbegriff
Loeb, I. (2014) · Synthese · doi:10.1007/s11229-014-0399-0 · Cited by 3
Kurt Gödel and Computability Theory
Zach, R. (2006) · Lecture notes in computer science · doi:10.1007/11780342_59 · Cited by 4
Truth versus information in logic programming
Naish, L., & Søndergaard, H. (2013) · Theory and Practice of Logic Programming · doi:10.1017/s1471068413000069 · Cited by 4
Jean van Heijenoort’s Conception of Modern Logic, in Historical Perspective
Anellis, I. H. (2012) · Logica Universalis · doi:10.1007/s11787-012-0055-8 · Cited by 3
“One may likewise think of Russell’s letter to Philip Edward Bertrand Jourdain (1879–1918) of April 1909 (quoted in [127, p. 117]), stating that he “[does] not prove the independence of primitive propositions in logic. . . .” Precisely one of the main points made by van Heijenoort in “Système et métasystème chez Rus…”
BackgroundInfluentialUniting model theory and the universalist tradition of logic: Carnap’s early axiomatics
Loeb, I. (2014) · Synthese · doi:10.1007/s11229-014-0425-2 · Cited by 3
Kazimierz Ajdukiewicz on transcendental idealism from a semantic point of view
Chrudzimski, A. (2016) · Studies in East European Thought · doi:10.1007/s11212-016-9248-7 · Cited by 3
Popper’s Theory of World 3 and the Evolution of the Internet
Backes, P. (2016) · Philosophy of the Social Sciences · doi:10.1177/0048393116641332 · Cited by 3
Spinorial space-time and the origin of Quantum Mechanics. The dynamical role of the physical vacuum
Mestres, L. G. (2016) · EPJ Web of Conferences · doi:10.1051/epjconf/201612605006 · Cited by 3
The Logic of Turing Progressions
Reyes, E. H., & Joosten, J. J. (2019) · Notre Dame Journal of Formal Logic · doi:10.1215/00294527-2019-0037 · Cited by 3
Danesi, M. (2018) · Mathematics in mind · doi:10.1007/978-3-319-93254-5_4 · Cited by 3
Mojtahedi, M. (2021) · Logic, epistemology, and the unity of science · doi:10.1007/978-3-030-53654-1_9 · Cited by 3
Public Announcement Logic in HOL
Reiche, S., & Benzmüller, C. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-65840-3_14 · Cited by 4
Systemic and cybernetic knowingness: relating “(a)symmetry” and “subtleness”?
Bulz, N. (2009) · Kybernetes · doi:10.1108/03684920910976862 · Cited by 4
Hybrid Intellectualization of the Management System in Aircraft Manufacture
Akhmedyanova, G. F., & Пищухин, А. М. (2021) · Russian Aeronautics · doi:10.3103/s1068799821010220 · Cited by 3
Lorenzen Between Gentzen and Schütte
Kähle, R., & Oitavem, I. (2021) · Logic, epistemology, and the unity of science · doi:10.1007/978-3-030-65824-3_5 · Cited by 3
“Gödel (1931) showed that this programme cannot be carried out in its original form.”
BackgroundElkind, L. D. C., & Zach, R. (2022) · The Review of Symbolic Logic · doi:10.1017/s1755020321000587 · Cited by 3
On the necessity of importing neurobiology into mathematics
Filippov, M., & Zeki, S. (2022) · PsyCh Journal · doi:10.1002/pchj.524 · Cited by 3
An Investigation into True Reality: Observer, 5D Space, and Cognizance
Hossain, J. (2023) · Open Journal of Philosophy · doi:10.4236/ojpp.2023.134045 · Cited by 5
Selection closedness and scoring correspondences
Koray, S., & Senocak, T. (2024) · Social Choice and Welfare · doi:10.1007/s00355-024-01529-y · Cited by 2
On formal limitations of causal ecological networks
Damos, P. T. (2024) · Philosophical Transactions of the Royal Society B Biological Sciences · doi:10.1098/rstb.2023.0170 · Cited by 5
Verifying a Radio Telescope Pipeline Using HaliVer: Solving Nonlinear and Quantifier Challenges
van den Haak, L. B., Wijs, A., Huisman, M., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68150-9_9 · Cited by 3
Consciousness and Mathematics: A Number Theoretic Approach to Modelling Reality
Samarawickrama, M. (2025) · Journal of Physics Conference Series · doi:10.1088/1742-6596/3027/1/012013 · Cited by 4
“This fundamental limitation is reflected in 2 Gödel’s incompleteness theorems [14], which assert that in any formal mathematical or logical system, there will always be true statements that cannot be proven within the system itself.”
Mathematical induction in ramified type theory
Royse, J. R. (1969) · Mathematical logic quarterly · doi:10.1002/malq.19690150103 · Cited by 5
An incompleteness theorem for βn-models
Mummert, C., & Simpson, S. G. (2004) · Journal of Symbolic Logic · doi:10.2178/jsl/1082418545 · Cited by 3
Modèles épistémologiques pour le métalangage
Bouquiaux, L., Dubuisson, F., & Leclercq, B. (2013) · Signata · doi:10.4000/signata.544 · Cited by 3
Delegated Causality of Complex Systems
Vidunas, R. (2018) · Axiomathes · doi:10.1007/s10516-018-9377-3 · Cited by 5
Mathematical and Technological Computability
Hansson, S. O. (2018) · Philosophy of engineering and technology · doi:10.1007/978-3-319-93779-3_9 · Cited by 3
Evolutionary Development: A Universal Perspective
Smart, J. M. (2019) · Springer proceedings in complexity · doi:10.1007/978-3-030-00075-2_2 · Cited by 4
Strategic Prospective: Definitions and Key Concepts
Trujillo-Cabezas, R., & Verdegay, J. L. (2019) · Studies in fuzziness and soft computing · doi:10.1007/978-3-030-25432-2_2 · Cited by 3
Undecidability and Unpredictability: Not Limitations, but Triumphs of Science
Müller, M. P. (2021) · The frontiers collection · doi:10.1007/978-3-030-70354-7_2 · Cited by 5
Rasetti, M. (2021) · Contemporary systems thinking · doi:10.1007/978-3-030-71877-0_10 · Cited by 4
Semiotic analysis of symbolic logic using tagmemic theory: with implications for analytic philosophy
Poythress, V. S. (2021) · Semiotica · doi:10.1515/sem-2020-0018 · Cited by 3
Cooper, S. B., & Leeuwen, J. V. (2013) · Elsevier eBooks · doi:10.1016/b978-0-12-386980-7.50022-8 · Cited by 3
Scholz, R. W. (1998) · Springer eBooks · doi:10.1007/978-3-642-58801-3_14 · Cited by 3
Towards a Theory of Information
Lenski, W. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25967-1_7 · Cited by 3
Towards Cyber-Phenomenology: Aesthetics and Natural Computing in Multi-Level Information Systems
Schroeder, M. J. (2014) · Mathematics for industry · doi:10.1007/978-4-431-55105-8_5 · Cited by 3
On a Relationship between Gödel's Second Incompleteness Theorem and Hilbert's Program
Akiyoshi, R. (2009) · Annals of the Japan Association for Philosophy of Science · doi:10.4288/jafpos.17.0_13 · Cited by 3
Introduction: Metaphysical and Postmetaphysical Relationships of Humans with Nature and Life
Witzany, G. (2009) · Springer eBooks · doi:10.1007/978-90-481-3319-2_1 · Cited by 3
“…sentences as they occur in philosophy and theology, the school of logical empirism (Carnap 1931a, 1931b, 1934, 1939, 1956, 1966; Neurath 1932; Gödel 1931, and later on Russell 1940; Tarski 1966) at the beginning of the 1930s tried to construct a formalised language of exact sciences…”
BackgroundWoleński, J. (2005) · Cairn.info · doi:10.3917/rip.234.0459 · Cited by 3
Recursive Functions: An Archeological Look
Odifreddi, P. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0717-0_3 · Cited by 4
Gödel's Incompleteness Theorems and Computer Science
Murawski, R. (1997) · Foundations of Science · doi:10.1023/a:1009639629935 · Cited by 9
Jean van Heijenoort’s Contributions to Proof Theory and Its History
Anellis, I. H. (2012) · Logica Universalis · doi:10.1007/s11787-012-0061-x · Cited by 3
“He was famous for his editorial work, and especially for his anthology From Frege to Gödel (1967) [164], which, as a representative documentary history of modern logic during the formative period of 1879–1931, has attained, in the words of Feferman [51, p. 5], [53]“the status of a classic.””
BackgroundGödel incompleteness and the black hole information paradox
Srikanth, R., & Hebri, S. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0089-2 · Cited by 3
Existential arithmetization of Diophantine equations
Matiyasevich, Y. (2008) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2008.09.009 · Cited by 3
The Concept of Truth in a Finite Universe
Raatikainen, P. (2000) · Journal of Philosophical Logic · doi:10.1023/a:1026542526897 · Cited by 3
Increasing returns and economic progress revisited
Fischer, J. (2003) · Journal of Economic Studies · doi:10.1108/01443580310455250 · Cited by 3
Undecidable Classical Properties of Observers
Aerts, S. (2005) · International Journal of Theoretical Physics · doi:10.1007/s10773-005-9008-9 · Cited by 3
L'infinité des nombres premiers : une étude de cas de la pureté des méthodes
Arana, A. (2011) · Les études philosophiques · doi:10.3917/leph.112.0193 · Cited by 3
“[18] Kurt Gödel. über formal unentscheidhare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, 38:173-198, 1931.”
BackgroundInfluentialBrigner, W. L. (1983) · Perceptual and Motor Skills · doi:10.2466/pms.1983.57.3f.1135 · Cited by 3
Iterative Characterizations of Computable Unary Functions: A General Method
Mazzanti, S. (1997) · Mathematical logic quarterly · doi:10.1002/malq.19970430104 · Cited by 3
Formal Axiomatic Theories Based on a Three-Valued Logic
Zaslavsky, I. D. (2005) · Journal of Mathematical Sciences · doi:10.1007/s10958-005-0353-2 · Cited by 3
Toward El Dorado for Cloud Computing
Eberbach, E., & Reuter, A. (2015) · doi:10.1145/2797433.2797446 · Cited by 3
Of men and ideas (after Mandelbrot)
Domb, C. (1989) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(89)90174-7 · Cited by 3
Ein Typenfreies System der Logik mit Ausreichender Mathematischer Anwendungsfähigkeit I
Ackermann, W. (1958) · Archive for Mathematical Logic · doi:10.1007/bf01977111 · Cited by 3
Killinger, J. E. (2007) · Journal of Religion and Health · doi:10.1007/s10943-007-9117-2 · Cited by 3
Formal versus self-organised knowledge systems: A network approach
Masucci, A. P. (2011) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.06.074 · Cited by 5
Paired Structures in Logical and Semiotic Models of Natural Language
Rodríguez, J. T., Franco, C. A., Montero, J., et al. (2014) · Communications in computer and information science · doi:10.1007/978-3-319-08855-6_57 · Cited by 3
A Free‐Variable Theory of Primitive Recursive Arithmetic
Schwartz, D. G. (1987) · Mathematical logic quarterly · doi:10.1002/malq.19870330210 · Cited by 3
KEA - A Knowledge Management System for Mathematics
Jeschke, S., Natho, N., & Wilke, M. (2007) · doi:10.1109/icspc.2007.4728598 · Cited by 3
“Index Terms - Knowledge Mangementment System, Knowledge Engineering, Web Engineering, Semantic Web, Natural Language Processing, Information Retrieval I. INTRODUCTION Knowledge management takes an important function in the modem society.”
BackgroundThe achievements of the Polish school of logic
Woleński, J. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.033 · Cited by 7
What Is the Concept of Computation?
Sieg, W. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-94418-0_39 · Cited by 3
A refinement to the general mechanistic account
Hatleback, E., & Spring, J. (2019) · European Journal for Philosophy of Science · doi:10.1007/s13194-018-0237-1 · Cited by 3
“…of transistors and other silicon features of the computer chip.35 It is compiled into the binary instruction set.36 Accordingly, the set of files under discussion 32 Turing’s result has been proven equivalent in relevant ways to approaches by Gödel (see Gödel (1931)) and Church (see Church (1936)).”
MethodThe complexity of identifying characteristic formulae
Aceto, L., Achilleos, A., Francalanza, A., et al. (2020) · Journal of Logical and Algebraic Methods in Programming · doi:10.1016/j.jlamp.2020.100529 · Cited by 3
“By similar reasoning, completeness for First-order Logic is undecidable, as satisfiability is undecidable [13].”
MethodDedekinds Sätze und Peanos Axiomata
Kähle, R. (2021) · Philosophia Scientae · doi:10.4000/philosophiascientiae.2846 · Cited by 3
Is there an Axiom for Everything?
Béziau, J.-Y. (2021) · Springer eBooks · doi:10.1007/978-3-662-63187-4_8 · Cited by 3
El Pensamiento Complejo en las Ciencias Sociales: hacia una nueva Organización de la Empresa
Pérez, M. N. V., & Axpe, M. R. V. (2020) · Revista Ciencias de la Complejidad · doi:10.48168/cc012020-004 · Cited by 9
A recursion theoretic foundation of computation over real numbers
Ng, K. M., Tavana, N. R., & Yang, Y. (2021) · Journal of Logic and Computation · doi:10.1093/logcom/exab042 · Cited by 3
“schemes similar to the class of primitive and partial recursive functions defined by Gödel [3, 4] and Kleene [9].”
MethodInfluentialPhysical Possibility and Determinate Number Theory
Berry, S. E. (2021) · Philosophia Mathematica · doi:10.1093/philmat/nkab013 · Cited by 3
Hookway, C. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.008 · Cited by 4
Parshall, K. V. H. (1991) · The Mathematical Intelligencer · doi:10.1007/bf03023829 · Cited by 3
Hofmann, M. A. (2015) · Online World Conference on Soft Computing in Industrial Applications · doi:10.1109/wsc.2015.7408379 · Cited by 6
Typed syntactic meta-programming
Devriese, D., & Piessens, F. (2013) · ACM SIGPLAN Notices · doi:10.1145/2544174.2500575 · Cited by 3
The Future of Jihadists and WMD
Ackerman, G. A. (2009) · CRC Press eBooks · doi:10.1201/9781420069679.ch14 · Cited by 3
Einführende Betrachtungen über Algorithmen
Hermes, H. (1961) · Springer eBooks · doi:10.1007/978-3-662-01462-2_1 · Cited by 3
The boundedness and zero isolation problems for weighted automata over nonnegative rationals
Czerwinski, W. K., Lefaucheux, E., Mazowiecki, F., et al. (2022) · Proceedings - Symposium on Logic in Computer Science · doi:10.1145/3531130.3533336 · Cited by 3
Papadopoulos, A. (2023) · Springer eBooks · doi:10.1007/978-3-030-19071-2_147-1 · Cited by 3
The Nature of Mathematics: Its Role and its Influence
Dossey, J. A. (2006) · Emerald Group Publishing Limited eBooks · doi:10.1108/978-1-60752-874-620251004 · Cited by 3
Paynter, S. E. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45251-6_17 · Cited by 3
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.