Ü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 701–800 of 2,380
Kanamori, A. (2009) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1231081769 · Cited by 8
Russell, Presupposition, and the Vicious-Circle Principle
Jung, D. (1999) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1039096305 · Cited by 8
Equation or Algorithm: Differences and Choosing Between Them
Gaucherel, C., Bérard, S., & Munoz, F. (2010) · Acta Biotheoretica · doi:10.1007/s10441-010-9119-4 · Cited by 10
“Gödel (1931) showed that any 170 given branch of mathematics contains proposals whose validity cannot be proven using the rules and axioms of that particular mathematical branch.”
BackgroundA modern elaboration of the ramified theory of types
Laan, T., & Nederpelt, R. (1996) · Studia Logica · doi:10.1007/bf00370835 · Cited by 8
Bolzano, Frege, and Husserl on Reference and Object
Føllesdal, D. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0004 · Cited by 8
Time, Arbitrage, and the Law of One Price: The Case for a Paradigm Shift
Falahati, K. (2019) · Journal of Economic Issues · doi:10.1080/00213624.2019.1573082 · Cited by 9
A Formally Verified Abstract Account of Gödel’s Incompleteness Theorems
Popescu, A., & Traytel, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-29436-6_26 · Cited by 8
Gödel’s incompleteness theorem and Universal physical theories
Ben-Ya’acov, U. (2019) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1391/1/012067 · Cited by 16
Incompleteness and the Halting Problem
Calude, C. S. (2021) · Studia Logica · doi:10.1007/s11225-021-09945-2 · Cited by 8
KURT GÖDEL ON LOGICAL, THEOLOGICAL, AND PHYSICAL ANTINOMIES
Lethen, T. (2021) · Bulletin of Symbolic Logic · doi:10.1017/bsl.2021.41 · Cited by 8
Introduction to the handbook of recursive mathematics
Ershov, Y. L., Гончаров, С. С., Nerode, A., et al. (1998) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(98)80045-1 · Cited by 8
Mostowski, A. (1979) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70458-6 · Cited by 11
H e2@ C 60: Thoughts of the concept of a molecule and of the concept of a bond in quantum chemistry
Kryachko, E. S., & Nikolaienko, T. Y. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24916 · Cited by 8
Super-exponentials nonprimitive recursive, but rudimentary
Calude, C. S. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90205-5 · Cited by 8
How much can analog and hybrid systems be proved (super-)Turing
Bournez, O. (2005) · Applied Mathematics and Computation · doi:10.1016/j.amc.2005.09.070 · Cited by 8
“The original arguments in [23] are based on an informal notion of deduction.”
BackgroundSchmidt, J. C. (2003) · Journal for General Philosophy of Science · doi:10.1023/a:1023296302464 · Cited by 8
Glanville, R. (2001) · Kybernetes · doi:10.1108/03684920110391904 · Cited by 8
New method for ecological monitoring based on the method of self-organising mathematical models
Timoshevskiĭ, A. N., Yeremin, V., & Kalkuta, S. A. (2003) · Ecological Modelling · doi:10.1016/s0304-3800(02)00403-9 · Cited by 8
Omega-consistency and the diamond
Boolos, G. (1980) · Studia Logica · doi:10.1007/bf00370322 · Cited by 8
CARAMEL: A step towards reflection in natural language understanding systems
Sabah, G., & Briffault, X. (2002) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/tai.1993.633965 · Cited by 8
Strube, G. (2001) · Elsevier eBooks · doi:10.1016/b0-08-043076-7/01441-8 · Cited by 14
Construction and deduction methods for the formal development of software
von Henke, F. W., Dold, A., Rueß, H., et al. (1995) · Lecture notes in computer science · doi:10.1007/bfb0015465 · Cited by 8
Zusammenhang der mehrfachen und transfiniten Rekursionen
Péter, R. (1950) · Journal of Symbolic Logic · doi:10.2307/2268337 · Cited by 8
Some concepts concerning formal systems of number theory
Kreisel, G. (1952) · Mathematische Zeitschrift · doi:10.1007/bf01192912 · Cited by 8
Partial closures and semantics of while: Towards an iteration-based theory of data types
Germano, G., & Mazzanti, S. (1984) · Lecture notes in mathematics · doi:10.1007/bfb0099485 · Cited by 8
Казанска, А. М. (2025) · doi:10.64357/tatunitycanon · Cited by 7
The Löwenheim-Skolem Theorem, Theories of Quantification, and Proof Theory
Anellis, I. H. (2008) · Birkhäuser Boston eBooks · doi:10.1007/978-0-8176-4769-8_6 · Cited by 7
Medicine: The Decisive Test of Anticipation
Nadin, M. (2016) · Springer eBooks · doi:10.1007/978-3-319-45142-8_1 · Cited by 11
Urquhart, A. (2016) · Bulletin of Symbolic Logic · doi:10.1017/bsl.2016.35 · Cited by 7
Can Machines Design? An Artificial General Intelligence Approach
Hein, A. M., & Condat, H. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-97676-1_9 · Cited by 10
CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS
Cheng, Y. (2021) · Bulletin of Symbolic Logic · doi:10.1017/bsl.2020.44 · Cited by 7
Do Computers "Have Syntax, But No Semantics"?
Peregrin, J. (2021) · Minds and Machines · doi:10.1007/s11023-021-09564-9 · Cited by 10
“The concepts of syntax and semantics moved to the center of discussions in logic in the 1930’s, in connection with the path-breaking results of Gödel (1930, 1931).”
ResultThe Connes embedding problem: A guided tour
Goldbring, I. (2022) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1768 · Cited by 27
Ertel, W. (2011) · Undergraduate topics in computer science · doi:10.1007/978-0-85729-299-5_1 · Cited by 7
A theory of implicit commitment
Łełyk, M., & Nicolai, C. (2022) · Synthese · doi:10.1007/s11229-022-03601-5 · Cited by 7
“From the results of Gödel (1931) one can infer that if A is justified in believing the axioms of a sufficiently powerful formal mathematical system S, then they will not be explicitly committed to the various articulations of the soundness of S in the language LS , including ‘S is consistent’, or…”
BackgroundBlumenthal, R. L. (2022) · ACM Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/3478431.3499309 · Cited by 8
Perception, Cognition and Thought: Part IV Consciousness, Awareness, and “I”
Lyman, G. H., Lyman, C. H., & Kuderer, N. M. (2023) · Cancer Investigation · doi:10.1080/07357907.2023.2248785 · Cited by 7
Uncertainty, predictability and decidability in chaotic dynamical systems
Rasetti, M. (1995) · Chaos Solitons & Fractals · doi:10.1016/0960-0779(94)e0084-3 · Cited by 7
Emergent bipartiteness in a society of knights and knaves
del Genio, C. I., & Gross, T. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/10/103038 · Cited by 7
Things that can be made into themselves
Stephan, F., & Teutsch, J. (2014) · Information and Computation · doi:10.1016/j.ic.2014.02.002 · Cited by 7
Omnipresence, Multipresence and Ubiquity: Kinds of Generality in and Around Mathematics and Logics
Grattan-Guinness, I. (2011) · Logica Universalis · doi:10.1007/s11787-010-0023-0 · Cited by 7
The FE-closure operator in countable-valued logic
Marchenkov, S. S., & Kalinina, I. S. (2013) · Moscow University Computational Mathematics and Cybernetics · doi:10.3103/s0278641913030084 · Cited by 7
Consistent structuring of inconsistent knowledge
Burgin, M., & Mestdagh, C. N. J. D. V. (2013) · Journal of Intelligent Information Systems · doi:10.1007/s10844-013-0270-7 · Cited by 9
Bell, J. (2012) · Handbook of the history of logic · doi:10.1016/b978-0-444-51621-3.50009-8 · Cited by 7
Invariance as a Tool for Ontology of Information
Schroeder, M. J. (2016) · Information · doi:10.3390/info7010011 · Cited by 9
The scientific world conception: logical positivism
Richardson, A. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.032 · Cited by 7
Rabossi, E. A. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.042 · Cited by 7
Logical formalization and reasoning for computerized interactive storytelling
Jantke, K. P. (2010) · IEEE International Conference on Progress in Informatics and Computing · doi:10.1109/pic.2010.5687910 · Cited by 7
Continually adding self-invented problems to the repertoire: First experiments with POWERPLAY
Srivastava, R. K., Steunebrink, B. R., Stollenga, M., & Schmidhuber, J. (2012) · IEEE International Conference on Development and Learning (ICDL) · doi:10.1109/devlrn.2012.6400843 · Cited by 9
“All problem solvers can be uniquely encoded [5] or implemented on universal computers such as universal Turing Machines (TM) [27].”
BackgroundThe robot and the human. Where’s their similarity limit?
Ivanitskii, G. R. (2018) · Physics-Uspekhi · doi:10.3367/ufne.2018.03.038302 · Cited by 9
Indeterminism and Undecidability
Landsman, K. (2021) · The frontiers collection · doi:10.1007/978-3-030-70354-7_3 · Cited by 16
“See Gödel (1931) and Bell (1964)!”
BackgroundMikkilineni, R., Morana, G., & Burgin, M. (2015) · doi:10.1145/2797433.2797444 · Cited by 7
Irreversibility in thermodynamics
Zak, M. A. (1996) · International Journal of Theoretical Physics · doi:10.1007/bf02083821 · Cited by 7
On the relative consistency of set theory
Orey, S. (1956) · Journal of Symbolic Logic · doi:10.2307/2269103 · Cited by 7
“The above argument is due to Firestone, who demonstrated in [1] that the system resulting from the system of type theory P of [3] by adding axioms for the iota operator, (2) and (3), or (1) and (2), contains a model for 2.”
BackgroundThe Mathematical Turns in Logic
Grattan-Guinness, I. (2004) · Handbook of the history of logic · doi:10.1016/s1874-5857(04)80021-9 · Cited by 7
Historical and Computational Aspects of Paraconsistency in View of the Logic Foundation of Databases
Decker, H. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36596-6_4 · Cited by 10
Uncomputability and Physical Law
Lloyd, S. (2017) · Theory and applications of computability · doi:10.1007/978-3-319-43669-2_6 · Cited by 10
Epistemic Constraints on Autonomous Symbolic Representation in Natural and Artificial Agents
Windridge, D., & Kittler, J. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-78534-7_16 · Cited by 7
Reinforcement learning for procurement agents of factory of the future
Simsek, B., Albayrak, Ş., & Korth, A. (2005) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2004.1331051 · Cited by 7
Structural Complexity and Neural Networks
Bertoni, A., & Palano, B. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45808-5_21 · Cited by 7
On Gödel’s second incompleteness theorem
Jech, T. (1994) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1994-1191869-1 · Cited by 7
Fitch, F. B. (1944) · Journal of Symbolic Logic · doi:10.2307/2267881 · Cited by 7
Definability, decidability, complexity
Cégielski, P. (1996) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf02127802 · Cited by 7
We shall know: Hilbert’s apology
Vinnikov, V. (1999) · The Mathematical Intelligencer · doi:10.1007/bf03024831 · Cited by 7
Die Gödelschen Unvollständigkeitssätze
Kähle, R. (2007) · Mathematische Semesterberichte · doi:10.1007/s00591-006-0012-9 · Cited by 7
Löfgren, L. (1984) · International Journal of General Systems · doi:10.1080/03081078408934867 · Cited by 7
Rivières, J. D., & Levesque, H. J. (1988) · Computational Intelligence · doi:10.1111/j.1467-8640.1988.tb00088.x · Cited by 7
Macintyre, A. J. (1977) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1977-14334-6 · Cited by 7
Henkin's completeness proof: forty years later.
Leblanc, H., Roeper, P., Thau, M., et al. (1991) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093635746 · Cited by 7
Zermelo's Cantorian Theory of Systems of Infinitely Long Propositions
Taylor, R. (2002) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1182353918 · Cited by 7
Smullyan, R. M. (1984) · Synthese · doi:10.1007/bf00485461 · Cited by 7
Natural laws and human prediction
Chirikov, B. V. (2007) · Springer eBooks · doi:10.1007/bfb0101865 · Cited by 7
Operational Approaches to Complex Systems. An Introduction
Haken, H. (1985) · Springer series in synergetics · doi:10.1007/978-3-642-70795-7_1 · Cited by 7
A classification of mathematical concepts
Mehlberg, J. J. (1962) · Synthese · doi:10.1007/bf02274804 · Cited by 7
Are chaotic systems dynamically random?
Svozil, K. (1989) · Physics Letters A · doi:10.1016/0375-9601(89)90536-7 · Cited by 7
Interpretations With Parameters
Szczerba, L. W. (1980) · Mathematical logic quarterly · doi:10.1002/malq.19800260104 · Cited by 7
Axiom schemes for m-valued functional calculi of first order. Part II
Rosser, J. B., & Turquette, A. R. (1951) · Journal of Symbolic Logic · doi:10.2307/2268662 · Cited by 7
Towards an epistemology for software representations
Welty, C. (2002) · doi:10.1109/kbse.1995.490130 · Cited by 7
“It is not, however, completely first order because, as stated in the beginning of this section, set membership is a unary predicate .”
BackgroundPortfolio Monitoring in Theory and PracticePreprint
Michaud, R. O., Esch, D., & Michaud, R. (2015) · SSRN Electronic Journal · doi:10.2139/ssrn.2658662 · Cited by 7
TASKS FOR CLINICIANS: THE DIAGNOSTIC PROCESS
Dudley, H. A. F. (1969) · The Medical Journal of Australia · doi:10.5694/j.1326-5377.1969.tb49676.x · Cited by 7
Automatic feature extraction based structure decomposition method for multi-classification
Xie, L., Wei, H., Zhao, J., & Zhang, K. (2015) · Neurocomputing · doi:10.1016/j.neucom.2015.08.025 · Cited by 6
“The complexity theory can be viewed as a refinement of the theory of recursive functions, which is developed after Goedel’s paper about the imperfectness of formal systems[26].”
BackgroundWiener?s Prefiguring of a Cybernetic Design Theory
Fischer, T. R. (2015) · IEEE Technology and Society Magazine · doi:10.1109/mts.2015.2461172 · Cited by 7
“Studying with Pask, Glanville developed a notion that responded to the paradox that any universe should contain everything that it needs to contain, yet must be seen from outside if this is to be appreciated – analogously to Gödel’s incompleteness theorem [19] and to the paradox Russell found in Frege’s set theory [20…”
BackgroundAntecapere ergo sum: what price knowledge?
Nadin, M. (2012) · AI & Society · doi:10.1007/s00146-012-0400-8 · Cited by 7
Obtaining surface tension from contact angle data by the individual representation approach
Pászli, I., Mohammed‐Ziegler, I., & Hórvölgyi, Z. (2007) · Colloid & Polymer Science · doi:10.1007/s00396-007-1646-4 · Cited by 6
From computing with numbers to computing with numeric words
Fiorini, R. A. (2017) · IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC) · doi:10.1109/icci-cc.2017.8109734 · Cited by 6
“The 1931 Kurt Gödel results [16] state that in any logical model powerful enough to include integer arithmetic, there will always be true statements that are not provable.”
BackgroundThe Deduction Theorem (Before and After Herbrand)
Franks, C. (2021) · History and Philosophy of Logic · doi:10.1080/01445340.2021.1889117 · Cited by 6
Ethics and Complexity: Why Standard Ethical Frameworks Cannot Cope with Socio-Technological Change
Vidal, C., & Heylighen, F. (2022) · Springer eBooks · doi:10.1007/978-3-030-67004-7_12 · Cited by 7
Brändas, E. (2022) · Advances in quantum chemistry · doi:10.1016/bs.aiq.2022.08.002 · Cited by 6
Astrobiology: resolution of the statistical Drake equation by Maccone's lognormal method in 50 steps
Mieli, E., Valli, A. M. F., & Maccone, C. (2023) · International Journal of Astrobiology · doi:10.1017/s1473550423000113 · Cited by 7
Consciousness and Logic in a Quantum-Computing Universe
Zizzi, P. (2006) · Springer eBooks · doi:10.1007/3-540-36723-3_14 · Cited by 8
Konnexer, C. (1999) · Deutsche Vierteljahrsschrift für Literaturwissenschaft und Geistesgeschichte · doi:10.1007/bf03375617 · Cited by 6
Tarski and Leśniewski on Languages with Meaning Versus Languages without Use
Sundholm, G. (2003) · Springer eBooks · doi:10.1007/978-94-017-0249-2_9 · Cited by 6
The Word Problem for Finitely Presented Quandles is Undecidable
Belk, J., & McGrail, R. W. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47709-0_1 · Cited by 6
“A logician might ask whether the first-order theory of quandles is decidable [5].”
BackgroundSelf-Reference and Time According to Spencer-Brown
Kull, A. (1997) · Springer eBooks · doi:10.1007/978-3-642-60707-3_6 · Cited by 6
Perrone, A. (1995) · Lecture notes in computer science · doi:10.1007/3-540-58843-4_13 · Cited by 6
A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems
Kamareddine, F., & Laan, T. (2001) · Journal of Logic Language and Information · doi:10.1023/a:1011286100450 · Cited by 6
The lengths of proofs: Kreisel’s conjecture and Gödel’s speed-up theorem
Cavagnetto, S. (2009) · Journal of Mathematical Sciences · doi:10.1007/s10958-009-9408-0 · Cited by 6
Non-deterministic structures of computation
Fu, Y. (2014) · Mathematical Structures in Computer Science · doi:10.1017/s0960129514000012 · Cited by 8
Holistic Workflow for Autonomous History Matching using Intelligent Agents: A Conceptual Approach
Zangl, G., Al-Kinani, A., & Stundner, M. (2011) · SPE Digital Energy Conference and Exhibition · doi:10.2118/143842-ms · Cited by 6
Dynamic Knowledge—A Century of Evolution
Weber, G. F. (2013) · Sociology Mind · doi:10.4236/sm.2013.34036 · Cited by 7
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.