Ü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,301–1,400 of 2,380
Program Search as a Path to Artificial General Intelligence
Kaiser, Ł. (2007) · Cognitive technologies · doi:10.1007/978-3-540-68677-4_9 · Cited by 1
Language, Logic and Computations
Pudlák, P. (2013) · Springer monographs in mathematics · doi:10.1007/978-3-319-00119-7_2 · Cited by 1
Open problems in computational linear algebra
Sen, S. K. (2005) · Nonlinear Analysis · doi:10.1016/j.na.2004.12.040 · Cited by 2
Gilmore, P. C. (1962) · Journal of Symbolic Logic · doi:10.2307/2964652 · Cited by 1
“For example, that Peano's arithmetic is not complete in this sense is a conclusion that can be drawn from [1].”
BackgroundUnpredictable dynamics and collective brain
Zak, M. A., & Zak, A. (1994) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(94)90137-6 · Cited by 1
READING PIAGET'S SUBJECT: CONTRADICTION AND THE DISCURSIVE POLITICS OF GENETIC STRUCTURALISM
McHoul, A. (1986) · Discourse Studies in the Cultural Politics of Education · doi:10.1080/0159630860070106 · Cited by 1
Zur Axiomatisierung der k‐zahlig allgemeingültigen Ausdrücke des Stufenkalküls
Hasenjaeger, G. (1958) · Mathematical logic quarterly · doi:10.1002/malq.19580041203 · Cited by 1
Tousseul, S. (2012) · Ágora Estudos em Teoria Psicanalítica · doi:10.1590/s1516-14982012000200002 · Cited by 1
Meaning, Reality and Algorithms: Implications of the Turing Theorem
Cacace, F. (1997) · Springer eBooks · doi:10.1007/978-94-011-5428-4_3 · Cited by 1
Summa de Veritate Hamburgensis: Truth according to Wolfgang Künne
Sundholm, G. (2008) · dialectica · doi:10.1111/j.1746-8361.2008.01153.x · Cited by 1
Hereditarily finite representations of natural numbers and self-delimiting codes
Tarau, P. (2010) · doi:10.1145/1863597.1863602 · Cited by 1
“Related Work Ranking functions can be traced back to G¨odel numberings [G¨odel 1931, Hartmanis and Baker 1974] associated to formulas.”
BackgroundPudlák, P. (2006) · ACM SIGACT News · doi:10.1145/1189056.1189058 · Cited by 1
La ciencia lo dijo. Relaciones entre ciencia, razón y fe
Sols, I. (2013) · Scientia et Fides · doi:10.12775/setf.2013.004 · Cited by 1
Peregrin, J. (2007) · Journal of Physics Conference Series · doi:10.1088/1742-6596/82/1/012006 · Cited by 1
Turing, the internet and a theory for architecture
Trossen, D. (2012) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2317307.2317317 · Cited by 1
“He re-formulates Goedel’s earlier results in [2] by introducing a concept of formal and hypothetical machines called Turing machine (TM).”
BackgroundSome recent essays in the history of the philosophy of mathematics: A critical review
Tait, W. W. (1993) · Synthese · doi:10.1007/bf01306899 · Cited by 1
Le développement durable, nouvel enjeu pour l’humanisme
Vauge, C. (2013) · International Review of Education · doi:10.1007/s11159-013-9366-0 · Cited by 1
“Ces esprits audacieux ne réalisent pas qu’ils mettent en œuvre un processus auto-référent, dénoncé par les logiciens et les mathématiciens (Russell 1903, Gödel 1931), qui fragilise le nouvel humanisme.”
BackgroundIrrelevance and relevance of Gödel’s theorems to artificial intelligence
Kim, S. M. (1995) · Kybernetes · doi:10.1108/03684929510089367 · Cited by 1
Vollständigkeit im Stufenkalkül
Thiele, H. (1957) · Mathematical logic quarterly · doi:10.1002/malq.19570031303 · Cited by 1
Lösung eines markovschen Problems betreffs einer Ausdehnung des Begriffes der elementaren Funktion
Bereczki, I. (1952) · Acta Mathematica Academiae Scientiarum Hungaricae · doi:10.1007/bf02022522 · Cited by 1
Turing‐computability and artificial intelligence: Gödel’s incompleteness results
Kim, S. W., & Kim, S. (1995) · Kybernetes · doi:10.1108/03684929510094316 · Cited by 1
A generalization of the incompleteness theorem
Mostowski, A. W. (1979) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70271-x · Cited by 1
QUANTUM STATISTICAL MECHANICS AND MULTIPLICATIVE NUMBER THEORY
Bowick, M. J. (1991) · Elsevier eBooks · doi:10.1016/b978-0-444-88903-4.50032-9 · Cited by 1
The ecosystem, energy and human values
McLachlan-Karr, J. (2004) · Ecological Modelling · doi:10.1016/j.ecolmodel.2003.12.025 · Cited by 1
On the Shifting Structure of Mathematical Paradigms
Carpenter, J. M. (1989) · Springer eBooks · doi:10.1007/978-1-4613-3802-4_23 · Cited by 1
Propositional logic of reflexive sentences
Stepanov, V. A. (2007) · Automatic Documentation and Mathematical Linguistics · doi:10.3103/s0005105507030028 · Cited by 1
“We mean Goedel’s theorems [1] on incompleteness of formal systems and the tail of classifying theorems of other authors.”
MethodMéthode axiomatique et négation chez Hilbert
Audureau, É. (2007) · Philosophia Scientae · doi:10.4000/philosophiascientiae.335 · Cited by 1
Consistency, Models, and Soundness
Schirn, M. (2010) · Axiomathes · doi:10.1007/s10516-010-9110-3 · Cited by 1
Mueller, C. (2012) · ACM SIGARCH Computer Architecture News · doi:10.1145/2234336.2234339 · Cited by 1
Forcing Axioms, Finite Conditions and Some More
Džamonja, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-36039-8_3 · Cited by 1
“Gödel’s Incompleteness theorems [16] prove that for any consistent theory T which implies the Peano Axioms and whose axioms are presentable as a recursively enumerable set of sentences, so for any reasonable theory one would say, there is a sentence φ in the language of T such that T does not prove or disprove φ.”
BackgroundStarting at the Beginning: Turing’s Account Examined
Fresco, N. (2013) · Studies in applied philosophy, epistemology and rational ethics · doi:10.1007/978-3-642-41375-9_3 · Cited by 1
Über drei Erscheinungen von Unterschied in der Mathematik
Friedman, M. H. (2016) · Berichte zur Wissenschaftsgeschichte · doi:10.1002/bewi.201601742 · Cited by 1
Mestdagh, C. N. J. D. V., & Burgin, M. (2015) · Smart innovation, systems and technologies · doi:10.1007/978-3-319-19857-6_36 · Cited by 1
Tarau, P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-28228-2_7 · Cited by 1
“In fact, ranking functions for sequences can be traced back to Gödel numberings [9, 12] associated to formulas.”
BackgroundSocial Media and the Wall-Less Classroom
Danesi, M. (2016) · Mathematics education in the digital era · doi:10.1007/978-3-319-32280-3_3 · Cited by 1
Analytic and synthetic in logic
Abrusci, V. M. (2016) · Logic Journal of IGPL · doi:10.1093/jigpal/jzw015 · Cited by 1
“Gödel incompleteness theorem [5] gives a negative answer to the first question concerning the relationships between analytic definitions and synthetic definitions, when analytic definitions are syntactical definitions and synthetic definitions are semantical definitions.”
BackgroundInfluentialHausserl and the Linguistic Turn
Parsons, C. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0007 · Cited by 1
From political economy to positive economics
Schabas, M. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.018 · Cited by 1
Piller, C. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.022 · Cited by 1
Individualism vs. collectivism
Nicholson, P. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.023 · Cited by 2
Bakhurst, D. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.006 · Cited by 3
Zhou, Z., & Qi, G. (2016) · Communications in computer and information science · doi:10.1007/978-981-10-3168-7_3 · Cited by 1
“In 1931, Kurt Gödel published his incompleteness theorems (known as Gödel’s incompleteness theorems) [3], which are important in both of the mathematical logic and the philosophy mathematics.”
BackgroundThe Limits of Logic-Based Inherent Safety of Social Robots
Bentzen, M. M. (2016) · Philosophy of engineering and technology · doi:10.1007/978-3-319-45193-0_17 · Cited by 1
Cantini, A., Fujimoto, K., & Halbach, V. (2017) · Outstanding contributions to logic · doi:10.1007/978-3-319-63334-3_11 · Cited by 1
Computer Systems – Simple, Complicated or Complex
Strzałka, D. (2017) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-59415-6_37 · Cited by 1
General View of New Cybernetics in Physics
Kupervasser, O. (2017) · Elsevier eBooks · doi:10.1016/b978-0-12-812801-5.00001-2 · Cited by 1
Callinicos, A. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.024 · Cited by 1
Values Cockpits and Values Management
Glauner, F. (2017) · CSR, sustainability, ethics & governance · doi:10.1007/978-3-319-58513-0_3 · Cited by 1
Oppitz, M., & Tomsu, P. (2017) · Springer eBooks · doi:10.1007/978-3-319-61161-7_4 · Cited by 1
What One Has to Know When Attacking $$\textsf {P}$$ vs. $$\textsf {NP}$$ (Extended Abstract)
Hromkovic̆, J., & Rossmanith, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-662-55751-8_2 · Cited by 1
Innovation in Technology and Management
Minier, V., Bonnet, R. M., Bontems, V., de Graauw, T., Griffin, M., Helmich, F. P., Pilbratt, G. L., & Volonté, S. (2017) · Springer eBooks · doi:10.1007/978-3-319-60024-6_5 · Cited by 1
Economic Theory. The Axiomatisation of Homo Oeconomicus
Calvo, P. (2018) · Ethical economy · doi:10.1007/978-3-319-90784-0_2 · Cited by 1
Someone Is Always Already There In Front Of You Even Though You May Not Like It
Nake, F. (2018) · Journal of Science and Technology of the Arts · doi:10.7559/citarj.v10i3.569 · Cited by 2
Right to Resistance and Terrorism – the Example of Germany
Gesk, G. (2012) · German Law Journal · doi:10.1017/s207183220001806x · Cited by 1
Formalizing Constructive Quantifier Elimination in Agda
Pope, J. (2018) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.275.2 · Cited by 1
“Following Gödel’s incompleteness theorems [5] came several negative results in decidability.”
Bounded Reducibility for Computable Numberings
Bazhenov, N. A., Mustafa, M., & Ospichev, S. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-22996-2_9 · Cited by 1
Pragmatic Rationalism and Pragmatic Nominalism in the Lvov-Warsaw School
Marciszewski, W. (2019) · Springer eBooks · doi:10.1007/978-3-030-24486-6_10 · Cited by 1
Popper’s Falsification and Corroboration from the Statistical Perspectives
Lee, Y., & Pawitan, Y. (2021) · Springer eBooks · doi:10.1007/978-3-030-67036-8_7 · Cited by 1
“According to Gödel (1931), even in a mathematical deductive system, there always exists a proposition G that can be neither proved nor disproved.”
BackgroundA Glimpse of $$ \sum_{3} $$-elementarity
Wilken, G. (2020) · Springer eBooks · doi:10.1007/978-3-030-49424-7_21 · Cited by 1
Davies, R. (2020) · History and Philosophy of Logic · doi:10.1080/01445340.2020.1803707 · Cited by 1
Lesson Two: The Geographic Perspective
Ahamer, G. (2019) · Springer eBooks · doi:10.1007/978-3-319-51704-9_11 · Cited by 1
There May Be Many Arithmetical Gödel Sentences†
Lajevardi, K., & Salehi, S. (2020) · Philosophia Mathematica · doi:10.1093/philmat/nkaa041 · Cited by 1
Observations on Computability, Uncertainty, and Technology
Rosser, J. B. (2021) · Springer eBooks · doi:10.1007/978-3-030-58131-2_15 · Cited by 1
Observers, observations and referencing in physics theories
Ben-Ya’acov, U. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1956/1/012019 · Cited by 1
Unpredictability and entanglement in open quantum systems
Kazemi, J., & Weimer, H. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acf151 · Cited by 2
Spodbujanje sporazumevalne jezikovne zmožnosti ob primeru vabila na razredni stopnji
Ivič, M. K., & Filo, T. (2021) · University of Maribor, University Press eBooks · doi:10.18690/978-961-286-488-0.10 · Cited by 3
Voršič, I. (2021) · University of Maribor, University Press eBooks · doi:10.18690/978-961-286-488-0.8 · Cited by 6
Pogledi na slovenščino kot neprvi jezik v zgodnjem izobraževanju
Haramija, D., & Pulko, S. (2021) · University of Maribor, University Press eBooks · doi:10.18690/978-961-286-488-0 · Cited by 24
Spodbujanje jezikovnih kompetenc in medkulturne zmožnosti predšolskih otrok
Rošer, B. B. (2021) · University of Maribor, University Press eBooks · doi:10.18690/978-961-286-488-0.5 · Cited by 4
The Contribution of Polish Logicians to Recursion Theory
Murawski, R. (1998) · Springer eBooks · doi:10.1007/978-94-011-5108-5_22 · Cited by 1
Blending Theory and Mathematical Cognition
Danesi, M. (2021) · Springer eBooks · doi:10.1007/978-3-030-44982-7_50-1 · Cited by 1
Provability logic: models within models in Peano Arithmetic
Berarducci, A., & Mamino, M. (2022) · Bollettino Della Unione Matematica Italiana · doi:10.1007/s40574-022-00325-9 · Cited by 1
Climate Modelling Beyond the Complexity: Challenges in Model-Building
Mihailović, D. T. (2010) · Springer eBooks · doi:10.1007/978-90-481-8695-2_5 · Cited by 1
Software Engineering as an Alchemical Process: Establishing a Philosophy of the Discipline
Mazzara, M., Farina, M., Krylová, A., Semenova, E., & Mohamed, M. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-93135-3_2 · Cited by 3
Theories of space-time in modern physics
Boi, L. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.016 · Cited by 1
Moore, F. C. T. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.007 · Cited by 2
van Atten, M. (2014) · Logic, epistemology, and the unity of science · doi:10.1007/978-3-319-10031-9_11 · Cited by 1
Semantic Theory of Truth—Formal Aspects
Woleński, J. (2019) · Logic, epistemology, and the unity of science · doi:10.1007/978-3-030-24536-8_8 · Cited by 1
Gödelian sentences, Rosserian sentences and truth
Assadi, Z., & Salehi, S. (2021) · Journal of Logic and Computation · doi:10.1093/logcom/exab075 · Cited by 1
Ertel, W. (2021) · Computational intelligence · doi:10.1007/978-3-658-32075-1_1 · Cited by 1
Smoryński, C. (1991) · Universitext · doi:10.1007/978-3-642-75462-3_1 · Cited by 1
A BIBLIOGRAPHY OF THE THEORY OF MODELS
(2014) · Elsevier eBooks · doi:10.1016/b978-0-7204-2233-7.50054-x · Cited by 1
Karczmar, A. G. (1972) · Springer eBooks · doi:10.1007/978-3-642-95201-2_1 · Cited by 1
STRONG HOMOMORPHISMS, CATEGORY THEORY, AND SEMANTIC PARADOX
WOLFGRAM, J., & Cook, R. T. (2022) · The Review of Symbolic Logic · doi:10.1017/s1755020322000223 · Cited by 1
Penchev, V. D. (2022) · International Journal of Pure and Applied Mathematics Research · doi:10.51483/ijpamr.2.2.2022.24-62 · Cited by 1
Michaud, R. O. (2022) · Springer eBooks · doi:10.1007/978-3-031-21863-7_4 · Cited by 1
On Two Types of Concept Lattices in the Theory of Numberings
Bazhenov, N. A., Mustafa, M., & Nurakunov, A. M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20350-3_8 · Cited by 2
Wizualizacja informacji. Badania struktur informacji w poszukiwaniu prawdy
Osiński, G. (2023) · Fides Ratio et Patria Studia Toruńskie · doi:10.56583/frp.1975 · Cited by 1
Completeness in partial type theory
Kuchyňka, P., & Raclavský, J. (2023) · Journal of Logic and Computation · doi:10.1093/logcom/exac089 · Cited by 1
El urbanismo y los datos: oportunidades, riesgos y límites
Buhigas, M., & Solà-Morales, P. (2022) · ZARCH · doi:10.26754/ojs_zarch/zarch.2022197406 · Cited by 1
New Demands on the Symbols and Formalism Competency in the Digital Era
Ahl, L. M., & Helenius, O. (2022) · Mathematics education in the digital era · doi:10.1007/978-3-031-10141-0_9 · Cited by 1
Forms of Life and Cultural Endowments
Peterson, V. (2023) · The Pluralist · doi:10.5406/19446489.18.2.02 · Cited by 1
Engell, L. (2023) · Springer eBooks · doi:10.1007/978-3-658-38688-7_3 · Cited by 1
Dissipation and irreversibility in computing
Ferry, D. K., & Porod, W. (2023) · Materials Research Express · doi:10.1088/2053-1591/acebba · Cited by 1
Gödel, Escher, Bell: Contextual Semantics of Logical Paradoxes
Kishida, K. (2023) · Outstanding contributions to logic · doi:10.1007/978-3-031-24117-8_14 · Cited by 1
Danesi, M. (2023) · Mathematics in mind · doi:10.1007/978-3-031-31582-4_2 · Cited by 1
Clark, K. B. (2023) · Behavioral and Brain Sciences · doi:10.1017/s0140525x23000791 · Cited by 1
Li, C. T. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3328984 · Cited by 1
Economía axiomatica: sobre ética y afectos en el supuesto de codicia de la conducta racional
Calvo, P. (2024) · Pensamiento Revista de investigación e información filosófica · doi:10.14422/pen.v798.i304.y2023.026 · Cited by 1
Anthropo-Genetic Algorithm of the Mind
Bilgiç, M. (2024) · Open Journal of Philosophy · doi:10.4236/ojpp.2024.141014 · Cited by 1
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.