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
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Die Vollständigkeit der Axiome des logischen Funktionenkalküls
Gödel, K. (1930) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01696781 · Cited by 635
Self-citationZur Hilbertschen Beweistheorie
v. Neumann, J. (1927) · Mathematische Zeitschrift · doi:10.1007/bf01475439 · Cited by 179
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
I.—COMPUTING MACHINERY AND INTELLIGENCE
TURING, A. M. (1950) · Mind · doi:10.1093/mind/lix.236.433 · Cited by 10,290
Computing Machinery and Intelligence (1950)
Turing, A. (2004) · The Essential Turing · doi:10.1093/oso/9780198250791.003.0017 · Cited by 6,118
Muggleton, S. (1991) · New Generation Computing · doi:10.1007/bf03037089 · Cited by 1,044
Recursively enumerable sets of positive integers and their decision problems
Post, E. L. (1944) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1944-08111-1 · Cited by 872
Classes of recursively enumerable sets and their decision problems
Rice, H. G. (1953) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1953-0053041-6 · Cited by 869
Knowledge Representation and Reasoning
(2024) · Encyclopedia of Computer Graphics and Games · doi:10.1007/978-3-031-23161-2_300700 · Cited by 819
What you always wanted to know about Datalog (and never dared to ask)
Ceri, S., Gottlob, G., & Tanca, L. (1989) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.43410 · Cited by 700
Interpretation of AF C∗-algebras in Łukasiewicz sentential calculus
Mundici, D. (1986) · Journal of Functional Analysis · doi:10.1016/0022-1236(86)90015-7 · Cited by 698
Measurement in Psychology: A Critical History of a Methodological Concept
Michell, J. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511490040 · Cited by 617
General recursive functions of natural numbers
Kleene, S. C. (1936) · Mathematische Annalen · doi:10.1007/bf01565439 · Cited by 593
Metrics and laws of software evolution-the nineties view
Lehman, M. M., Ramil, J. F., Wernick, P. D., Perry, D. E., & Turski, W. M. (2002) · Proceedings Fourth International Software Metrics Symposium · doi:10.1109/metric.1997.637156 · Cited by 561
Systems of logic based on ordinals
(2001) · Mathematical Logic · doi:10.1016/b978-044450423-4/50007-3 · Cited by 543
On the interpretation of intuitionistic number theory
Kleene, S. C. (1945) · Journal of Symbolic Logic · doi:10.2307/2269016 · Cited by 538
The nature and plausibility of Cognitivism
Haugeland, J. (1978) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00074148 · Cited by 512
Tegmark, M. (2008) · Foundations of Physics · doi:10.1007/s10701-007-9186-9 · Cited by 463
Hilbert's Tenth Problem is Unsolvable
Davis, M. (1973) · The American Mathematical Monthly · doi:10.1080/00029890.1973.11993265 · Cited by 406
Differential Dynamic Logic for Hybrid Systems
Platzer, A. (2008) · Journal of Automated Reasoning · doi:10.1007/s10817-008-9103-8 · Cited by 390
Recursive predicates and quantifiers
Kleene, S. C. (1943) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1943-0007371-8 · Cited by 363
Scholz, R. W., Lang, D. J., Wiek, A., Walter, A. I., & Stauffacher, M. (2006) · International Journal of Sustainability in Higher Education · doi:10.1108/14676370610677829 · Cited by 360
“Hereby, validation always refers to a reference framework (Gödel, 1931) or metalevel, which determines what is considered as a true, valid or good and, respectively, as a false, invalid or bad result.”
BackgroundMultilanguage hierarchical logics, or: How we can do without modal logics
Giunchiglia, F., & Serafini, L. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90037-x · Cited by 343
Definability and decision problems in arithmetic
Robinson, J. (1949) · Journal of Symbolic Logic · doi:10.2307/2266510 · Cited by 314
On axiomatizability within a system
Craig, W. (1953) · Journal of Symbolic Logic · doi:10.2307/2266324 · Cited by 311
GIS and Society: Towards a Research Agenda
Sheppard, E. (1995) · Cartography and Geographic Information Systems · doi:10.1559/152304095782540555 · Cited by 273
Developmental robotics, optimal artificial curiosity, creativity, music, and the fine arts
Schmidhuber, J. (2006) · Connection Science · doi:10.1080/09540090600768658 · Cited by 268
Soare, R. I. (1996) · Bulletin of Symbolic Logic · doi:10.2307/420992 · Cited by 268
Locus Solum: From the rules of logic to the logic of rules
GIRARD, J.-Y. (2001) · Mathematical Structures in Computer Science · doi:10.1017/s096012950100336x · Cited by 267
Undecidability of the spectral gap
Cubitt, T. S., Perez-Garcia, D., & Wolf, M. M. (2015) · Nature · doi:10.1038/nature16059 · Cited by 262
A history of Haskell: being lazy with class
Hudak, P., Hughes, J., Peyton Jones, S., & Wadler, P. (2007) · Proceedings of the third ACM SIGPLAN conference on History of programming languages · doi:10.1145/1238844.1238856 · Cited by 261
The Turing Test: the first 50 years
French, R. M. (2000) · Trends in Cognitive Sciences · doi:10.1016/s1364-6613(00)01453-4 · Cited by 250
Gödel Machines: Fully Self-referential Optimal Universal Self-improvers
Schmidhuber, J. (2007) · Cognitive Technologies · doi:10.1007/978-3-540-68677-4_7 · Cited by 110
Blum, L., & Blum, M. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2115934119 · Cited by 70
Bernoulli's principle of insufficient reason and conservation of information in computer search
Dembski, W. A., & Marks, R. J. (2009) · 2009 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2009.5346119 · Cited by 32
“A debate also occurred in regard to Gödel’s theorem which, in its original form [29], [30], was understood only by mathematicians and logicians.”
BackgroundSchmidhuber, J. (2003) · arXiv · doi:10.48550/arxiv.cs/0309048 · Cited by 24
Towards an Actual Gödel Machine Implementation: a Lesson in Self-Reflective Systems
Steunebrink, B. R., & Schmidhuber, J. (2012) · Atlantis Thinking Machines · doi:10.2991/978-94-91216-62-6_10 · Cited by 11
Biological function and the genetic code are interdependent
Voie, Ø. A. (2006) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2005.08.146 · Cited by 3
Metadata
- Authors
- Gödel, K.
- Venue
- Monatshefte für Mathematik
- Published
- 2006-09
- Volume
- 149
- Issue
- 1
- Pages
- 1-29
- ISSN
- 0026-9255 (ISSN-L)
- 1436-5081
- OpenAlex
- W2114804254
- Cited by
- 2,077
- References
- 2
- FWCI
- 92.94
- Type
- journal article
- Language
- en
- Open access
- closed
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.