Ü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,601–1,700 of 2,380
Torretti, R. (1997) · Studies in History and Philosophy of Science Part B Studies in History and Philosophy of Modern Physics · doi:10.1016/s1355-2198(97)00002-6 · Cited by 3
On necessary but not-sufficient conditions
Sakai, H. (1974) · Archive for Mathematical Logic · doi:10.1007/bf02015374
Natural Language Processing of Mathematical Texts in mArachna
Blanke, M., Jeschke, S., Natho, N., Seiler, R., & Wilke, M. (2007) · Springer eBooks · doi:10.1007/978-1-4020-6264-3_54
Motta, E., Simi, M., & Attardi, G. M. (1989) · Topics in information systems · doi:10.1007/978-3-642-83397-7_3
Die signififchen Grundlagen der Mathematik
Monoury, G. (1934) · Erkenntnis · doi:10.1007/bf01793497
A Recursion-Theoretic View of Axiomatizable Theories
Pour‐El, M. B. (1970) · dialectica · doi:10.1111/j.1746-8361.1970.tb01219.x
“(2) The notion of interpretability of one type of formal logic into another formal theory possibly based on a different logic - see, for example, Gödel's translation of classical number theory into intuitionistic number theory [5] - see also the proof theoretic work of Herbrand, Kreisel, Spector and many others.”
BackgroundInfluentialA CLOSE-CLIPPED VIEW OF THE UNIVERSE, WITH A NOTE ON ITS ‘ORIGIN’ AND ‘AGE ’, AND OUR POSITION IN IT
POOLE, H. W. (1955) · The British Journal for the Philosophy of Science · doi:10.1093/bjps/vi.21.43
Izumi, Y. (1954) · Tohoku Mathematical Journal · doi:10.2748/tmj/1178245231
La logique et le Soi : les suites de certaines crises de la pensée occidentale
van Fraassen, B. C. (2012) · Diogène · doi:10.3917/dio.232.0028
Valmari, A. (2014) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.151.25
Post-anthropological archaeology
Bulbeck, D. (2000) · Anthropological Forum · doi:10.1080/00664670050006758
Kupka, T. (2013) · Berichte zur Wissenschaftsgeschichte · doi:10.1002/bewi.201301515
Über Gödel's Beweis der Unentscheidbarkeit: eine philosophische Bemerkung
Barbò, F. R. (1976) · Journal for General Philosophy of Science · doi:10.1007/bf01800774
Die Mathematik im Kreise der Naturwissenschaften II
Jacobs, K. (1984) · Die Naturwissenschaften · doi:10.1007/bf00455637
Some Implications of the Problem of “Consciousness and the Brain”
Иваницкий, А. М., & Ivanitskiĭ, G. A. (2010) · Neuroscience and Behavioral Physiology · doi:10.1007/s11055-010-9383-4
“One of the main theories of mathematical logic [29] holds that it cannot be proved by computation that 1 + 1 = 2, though the essence of this doubling is evident to everyone from everyday experience.”
BackgroundSuzuki, Y. (1985) · The British Journal for the Philosophy of Science · doi:10.1093/bjps/36.1.61
Irreducible complexities: from Gödel and Turing to the paradigm of Imperfect Knowledge Economics
Garofalo, G. (2013) · Quality & Quantity · doi:10.1007/s11135-013-9967-5 · Cited by 1
Remarques sur la notion de la perfection
Izumi, Y. (1952) · Tohoku Mathematical Journal · doi:10.2748/tmj/1178245372
Kodifikation und Aussagenlogik
Luckhardt, H. (1969) · Archive for Mathematical Logic · doi:10.1007/bf01982046
An isomorphism between monoids of external embeddings: About definability in arithmetic
Prunescu, M. (2002) · Journal of Symbolic Logic · doi:10.2178/jsl/1190150100
Hermes, H. (1978) · Heidelberger Taschenbücher · doi:10.1007/978-3-642-95327-9_3
Real-world computers and recursive function theory
Shenhar, A. J. (1991) · Computers & Electrical Engineering · doi:10.1016/0045-7906(91)90022-r
Reflection principles for synthetic theories of smooth manifolds
Yamada, S., & Kato, Y. (1997) · Nonlinear Analysis · doi:10.1016/s0362-546x(96)00153-8
A note on the first incompleteness theorem
Ishii, K. (2003) · Mathematical logic quarterly · doi:10.1002/malq.200310021
Different Notions of Constructivity – their Ontology
Ghose, A. (1978) · dialectica · doi:10.1111/j.1746-8361.1978.tb01316.x
Michels, A. (2003) · La clinique lacanienne · doi:10.3917/cla.006.0037
Transforming SAT into Termination of Rewriting
Zankl, H., Sternagel, C., & Middeldorp, A. (2009) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2009.07.023
“6 can be generalized to one sort by using the natural numbers as a carrier and representing formulas via a Gödel encoding [11].”
MethodBeweistheoretische Abgrenzung von Teilsystemen der Analysis
Schütte, K. (1980) · Monatshefte für Mathematik · doi:10.1007/bf01641707
Utility and Feasibility of Reasoning beyond Decidability in Semantic Technologies
Rudolph, S., & Schneider, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22688-5_2
“While it goes without saying that such an algorithm is clearly useful for all kind of querying or knowledge management tasks, results established back in the 1930s show that this property does not hold for all types of logics [ 6 ,24].”
BackgroundPudlák, P. (2006) · Proceedings - IEEE Conference on Computational Complexity/Proceedings · doi:10.1109/ccc.2006.21
Use of mathematical logical concepts in quantum mechanics: an example
Benioff, P. (2002) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/35/28/305
An example in axiomatic set theory
Kleinberg, E. M. (1981) · Advances in Mathematics · doi:10.1016/0001-8708(81)90062-1
Stabilization Through Fluctuations in Chaotic Systems
Zak, M. A., Zak, A., & Meyers, R. E. (1996) · Institute for Nonlinear Science · doi:10.1007/978-1-4612-3992-5_7
Calvete, J. J. (2011) · Journal of Proteomics · doi:10.1016/j.jprot.2011.06.030
The new AI is general and mathematically rigorous
Schmidhuber, J. (2010) · Frontiers of Electrical and Electronic Engineering in China · doi:10.1007/s11460-010-0105-z
On the cognoscibility of the world
Ioffe, B. L. (2014) · Physics of Atomic Nuclei · doi:10.1134/s1063778814080079
A New–old Characterisation of Logical Knowledge
Grattan-Guinness, I. (2012) · History and Philosophy of Logic · doi:10.1080/01445340.2012.675631
Sieg, W. (1991) · Rendiconti del Seminario Matematico e Fisico di Milano · doi:10.1007/bf02925207
Brand, M. (2014) · Information Processing Letters · doi:10.1016/j.ipl.2014.09.010
Essler, W. K. (2012) · Springer eBooks · doi:10.1007/978-3-531-19691-6_14
Bibliographie des ouvrages cités
Grize, J.-B. (1982) · Travaux de sciences sociales · doi:10.3917/droz.grize.1982.01.0259
Vidal, C. M., & Rives, J. P. Ú. (2014) · Studies in universal logic · doi:10.1007/978-3-319-09719-0_10
Algorithmen – Berechenbarkeit und Komplexität
Ernst, H., Schmidt, J., & Beneken, G. (2015) · Springer eBooks · doi:10.1007/978-3-658-01628-9_11 · Cited by 2
Church’s Theorem and Randomness
Mar, G. R. (2001) · Springer eBooks · doi:10.1007/978-94-010-0526-5_23 · Cited by 1
On a Check-Digit Method Based On Graph Coloring
Kulesza, K., & Kotulski, Z. (2007) · IEEE EUROCON - International Conference on Computer as a Tool (EUROCON) · doi:10.1109/eurcon.2007.4400439
Epistemological Implications of Artificial Intelligence
Brody, T. A. (1993) · Springer eBooks · doi:10.1007/978-3-642-78978-6_23
The Consistency and the Impredicative Statement
NISHIMURA, T. (1963) · Annals of the Japan Association for Philosophy of Science · doi:10.4288/jafpos1956.2.144
Mihailović, D. T., & Balaž, I. (2009) · doi:10.1109/icat.2009.5348403
“To show that, we will use the Gödel’s incompleteness theorem about number theory [18].”
MethodThe diagonalization method in quantum recursion theory
Svozil, K. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0115-z · Cited by 1
Fragmentary structure of global knowledge: constructive processes for interoperability
Heather, M., & Rossiter, N. (2009) · Kybernetes · doi:10.1108/03684920910977050
Computability of Boundary Set S
Estep, M. (2003) · Springer eBooks · doi:10.1007/978-94-017-0183-9_7
A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies
Deuber, W. A., & Thumser, W. (1994) · Combinatorics Probability Computing · doi:10.1017/s0963548300001103
Transfinite type theory and provability of second order formulas
Yukami, T. (1977) · Journal of the Mathematical Society of Japan · doi:10.2969/jmsj/02940633
Perlis, D. (1990) · Studies in cognitive systems · doi:10.1007/978-94-009-0553-5_5
Essler, W. K. (1999) · Springer eBooks · doi:10.1007/978-94-017-0689-6_13
Menke, A. G., Kappler, K. E., Gottlieb, J., et al. (2012) · SSRN Electronic Journal · doi:10.2139/ssrn.2011381
David Hilbert, Paper on ‘Mathematical problems’ (1901)
Hazewinkel, M. (2005) · Elsevier eBooks · doi:10.1016/b978-044450871-3/50138-8
Just, W. (1995) · Springer eBooks · doi:10.1007/978-3-642-79323-3_11
Optimized MOL‐PCR for Characterization of Microbial Pathogens
Wuyts, V., Roosens, N. H. C., Bertrand, S., et al. (2016) · Current Protocols in Cytometry · doi:10.1002/0471142956.cy1315s75
Hermes, H. (1969) · Springer eBooks · doi:10.1007/978-3-642-46178-1_3
On the Broader Epistemological Significance of Self-Justifying Axiom Systems
Willard, D. E. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44145-9_16 · Cited by 3
“Gödel was careful to insert a caveat into his historic paper [11], indicating a diluted form of Hilbert’s Consistency Program might have some success:”
BackgroundResultThe Public Phase of the Vienna Circle: From 1929 Until the “Anschluss”
Stadler, F. (2015) · Vienna Circle Institute library · doi:10.1007/978-3-319-16561-5_4
The end of philosophy as metaphysics
Glendinning, S. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.048 · Cited by 2
On Kant’s Philosophy of Mathematics from a Present-Day Perspective
Körner, S. (1994) · Springer eBooks · doi:10.1007/978-94-011-0834-8_4
The liberal democratic state: defences and developments
Bellamy, R. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.066
Crossley, J. N. (2011) · Springer eBooks · doi:10.1007/978-94-007-0080-2_3 · Cited by 1
Mathematical Induction: Definitions and Proofs by Induction
Nievergelt, Y. (2015) · Springer eBooks · doi:10.1007/978-1-4939-3223-8_4
Frangakis, C., Rubin, D. B., An, M., et al. (2007) · Biometrics · doi:10.1111/j.1541-0420.2007.00847_5.x
Constructive Ordinal Notation Systems
Gass, F. S. (1984) · Mathematics Magazine · doi:10.1080/0025570x.1984.11977093
Le paradoxe de Richard : une solution kolmogorovienne
Séguy-Duclot, A. (2015) · Dialogue · doi:10.1017/s0012217315000323
Logic and the Self: After Certain Crises in Western Thought
van Fraassen, B. C. (2011) · Diogenes · doi:10.1177/0392192112462191
Environment and Planning A: Intellectual Orphan or Place for Innovation?
Sheppard, E. S. (1998) · Environment and Planning A Economy and Space · doi:10.1068/a300381
Climbing Mount $$\varepsilon _{0}$$
Jervell, H. R. (2015) · Springer eBooks · doi:10.1007/978-3-319-10103-3_12
Grenzen algorithmischer Berechenbarkeit
Barth, A. P. (2003) · Vieweg+Teubner eBooks · doi:10.1007/978-3-322-91840-6_10
On Mathematicians Who Liked Logic
Grattan-Guinness, I. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30870-3_25
Robinson, W. S. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511498886.010
Robinson, W. S. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511498886.005
Pythia and Tyche: An Eternal Golden Braid
Kirousis, L. M., & Spirakis, P. G. (1989) · Springer eBooks · doi:10.1007/978-94-009-1175-8_34
Von der natürlichen über die künstliche zur Superintelligenz?
Mainzer, K. (2016) · Technik im Fokus · doi:10.1007/978-3-662-48453-1_10
Computer Science Perspectives on Prerational Intelligence
Braun, H. (2000) · Studies in cognitive systems · doi:10.1007/978-94-010-0870-9_82
Arithmetization of Analysis and Algebra
Gauthier, Y. (2015) · Studies in universal logic · doi:10.1007/978-3-319-22087-1_2
Harrison, R. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.020
Zahar, E. G. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.015
Robinson, W. S. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511498886.013
Bostock, D. (2012) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199651443.003.0008
Harel, D. (2002) · Springer eBooks · doi:10.1007/978-3-642-56261-7_3
Robinson, W. S. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511498886.002
Self-Referential Complex Systems and Aristotle's Four Causes
Malecic, A. (2015) · Advances in human and social aspects of technology book series · doi:10.4018/978-1-4666-8592-5.ch012
Introduction: The Internal Logic of Arithmetic
Gauthier, Y. (2015) · Studies in universal logic · doi:10.1007/978-3-319-22087-1_1
The continuing idealist tradition
Armour, L. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.035
Kybernetische Elemente in der philosophischen Bewußtseinstheorie
Klaczko-Ryndziun, S. (1975) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-5755-0_2
Logical Constructions (ii): Minds
Bostock, D. (2012) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199651443.003.0010
Livingston, J. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.027
The liberal democratic state: critics
Adamson, W. L. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.067
The Contradiction (i): The Problem
Bostock, D. (2012) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199651443.003.0002
Bell, D. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.046 · Cited by 2
The Contradiction (ii): A Simple Solution
Bostock, D. (2012) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199651443.003.0004
Potter, M. (2004) · doi:10.1093/acprof:oso/9780199269730.003.0022
PATTERNS AS CAUSES OF QUALITATIVE EVENTS
Robinson, W. S. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511498886.012
Potter, M. (2004) · doi:10.1093/acprof:oso/9780199269730.003.0023
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.