Ü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 601–700 of 2,380
Theorem Proving for Verification (Invited Tutorial)
Harrison, J. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70545-1_4 · Cited by 18
On Göde's Philosophical Assumptions
Hintikka, J. (1998) · Synthese · doi:10.1023/a:1005042207543 · Cited by 11
Syntactic and semantic reasoning in mathematics teaching and learning
Easdown, D. (2009) · International Journal of Mathematical Education in Science and Technology · doi:10.1080/00207390903205488 · Cited by 11
Computability of String Functions Over Algebraic Structures Armin Hemmerling
Hemmerling, A. (1998) · Mathematical logic quarterly · doi:10.1002/malq.19980440102 · Cited by 11
Sequence encoding without induction
Jeřábek, E. (2012) · Mathematical logic quarterly · doi:10.1002/malq.201200013 · Cited by 11
Strong Determinism vs. Computability
Calude, C. S., Campbell, D. I., Svozil, K., & Stefanescu, D. M. (1995) · Springer eBooks · doi:10.1007/978-94-017-3327-4_9 · Cited by 15
Hot: A concurrent automated theorem prover based on higher-order tableaux
Konrad, K. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055140 · Cited by 11
“It is a well known result of GSdel's Incompleteness Theorem [ 15 ] that completeness for consistent higher-order logics can not be achieved for standard model semantics.”
BackgroundThe problem of reductionism from a system theoretical viewpoint
von Lucadou, W., & Kornwachs, K. (1983) · Journal for General Philosophy of Science · doi:10.1007/bf01801653 · Cited by 11
The transformational machine: Theme and variations
Ershov, A. P. (1981) · Lecture notes in computer science · doi:10.1007/3-540-10856-4_71 · Cited by 11
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)80001-3 · Cited by 11
Some arithmetical restatements of the Four Color Conjecture
Matiyasevich, Y. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00115-8 · Cited by 11
Representing the Knowledge of Turing Machines
Shin, H. S., & Williamson, T. (1997) · Theory and decision library. Series C, Game theory, mathematical programming and operations research · doi:10.1007/978-1-4613-1139-3_8 · Cited by 11
NISHIMURA, T. (1961) · Journal of the Mathematical Society of Japan · doi:10.2969/jmsj/01310001 · Cited by 11
Svozil, K. (1995) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.1995.tb39024.x · Cited by 13
Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflection
Hickey, J. J., Nogin, A., Yu, X., et al. (2006) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/1159803.1159826 · Cited by 11
Edwards, D. J. (2025) · Frontiers in Computational Neuroscience · doi:10.3389/fncom.2025.1551960 · Cited by 13
Consequences of Gödel’s Theorems on Quantum Gravity
Faizal, M., Shabir, A., & Khan, A. K. (2024) · International Journal of Theoretical Physics · doi:10.1007/s10773-024-05818-1 · Cited by 10
Faizal, M., Shabir, A., & Khan, A. K. (2024) · Nuclear Physics B · doi:10.1016/j.nuclphysb.2024.116774 · Cited by 13
van Atten, M. (2014) · Logic, epistemology, and the unity of science · doi:10.1007/978-94-017-9217-2_7 · Cited by 10
Environmental Path-Entropy and Collective Motion
Devereux, H. L., & Turner, M. S. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.168201 · Cited by 12
Fu, Y. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39698-4_11 · Cited by 10
The computationalist reformulation of the mind-body problem
Marchal, B. (2013) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2013.03.014 · Cited by 11
González, A. J. (2014) · Nuclear Engineering and Technology · doi:10.5516/net.08.2014.714 · Cited by 10
Computing in Combinatorial Optimization
Cook, W. J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-319-91908-9_3 · Cited by 15
Kolmogorov’s contribution to intuitionistic logic
Coquand, T. (2007) · Springer eBooks · doi:10.1007/978-3-540-36351-4_2 · Cited by 10
Svozil, K. (1995) · Springer eBooks · doi:10.1007/978-94-017-3327-4_6 · Cited by 13
The Liberal Treatment of Difference: An Untimely Meditation on Culture and Civilization
Rapport, N. (2011) · Current Anthropology · doi:10.1086/661927 · Cited by 16
Introducing formalism in economics: The growth model of John von Neumann
Gloria-Palermo, S. (2010) · Panoeconomicus · doi:10.2298/pan1002153g · Cited by 10
A Note on Typed Truth and Consistency Assertions
Nicolai, C. (2015) · Journal of Philosophical Logic · doi:10.1007/s10992-015-9366-6 · Cited by 10
The Scope of Gödel’s First Incompleteness Theorem
Buldt, B. (2014) · Logica Universalis · doi:10.1007/s11787-014-0107-3 · Cited by 10
Sieg, W. (2009) · Handbook of the history of logic · doi:10.1016/s1874-5857(09)70012-3 · Cited by 14
Proof-Producing Reflection for HOL: With an Application to Model Polymorphism
Fallenstein, B., & Kumar, R. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22102-1_11 · Cited by 17
Non-standard finite fields overIΔ0+Ω1
D’Aquino, P., & Macintyre, A. J. (2000) · Israel Journal of Mathematics · doi:10.1007/bf02773575 · Cited by 10
Infinite combinatorics in mathematical biology
Shelah, S., & Strüngmann, L. (2021) · Biosystems · doi:10.1016/j.biosystems.2021.104392 · Cited by 10
From the Closed Classical Algorithmic Universe to an Open World of Algorithmic Constellations
Burgin, M., & Dodig-Crnković, G. (2013) · Studies in applied philosophy, epistemology and rational ethics · doi:10.1007/978-3-642-37225-4_16 · Cited by 10
Hilbert’s Tenth Problem and Paradigms of Computation
Matiyasevich, Y. (2005) · Lecture notes in computer science · doi:10.1007/11494645_39 · Cited by 10
New Millennium AI and the Convergence of History: Update of 2012
Schmidhuber, J. (2012) · The frontiers collection · doi:10.1007/978-3-642-32560-1_4 · Cited by 12
“One century later, Juliu s Lilienfeld invented the transistor (late 1920s), and Kurt Gödel layed the foundati ons of theoretical computer science with his work on universal formal languages and the l imits of proof and computation (1931) [20].”
InfluentialEffective Processes and Natural Law
Rosén, R. (1995) · Computerkultur · doi:10.1007/978-3-7091-6597-3_23 · Cited by 10
Computational Biochemistry of Antibodies and T-Cell Receptors
Novotný, J., & Bajorath, J. (1996) · Advances in protein chemistry · doi:10.1016/s0065-3233(08)60490-8 · Cited by 10
General iteration and unary functions
Germano, G., & Mazzanti, S. (1991) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(91)90029-l · Cited by 10
Bus versus cellular automata, and ultimate limitations of parallel processing
Rothstein, J. (1988) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(88)90514-6 · Cited by 10
ESTIMATING THE NON‐ENVIRONMENTAL CONSEQUENCES OF GREENHOUSE GAS REDUCTIONS IS HARDER THAN YOU THINK
DeCanio, S. J. (1999) · Contemporary Economic Policy · doi:10.1111/j.1465-7287.1999.tb00682.x · Cited by 11
Self-ignorance: Towards an extension of the Austrian paradigm
Aimar, T. (2007) · The Review of Austrian Economics · doi:10.1007/s11138-007-0026-0 · Cited by 10
“Flexible” predicates of formal number theory
Kripke, S. A. (1962) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1962-0140407-x · Cited by 10
Christian, C. C. (1980) · Monatshefte für Mathematik · doi:10.1007/bf01659490 · Cited by 10
Bounded Concatenation Theory as a Uniform Method for Proving Lower Complexity Bounds
Fleischmann, K., Mahr, B., & Siefkes, D. (1977) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70440-9 · Cited by 10
Mengentheoretische Begr�ndung der Logik
Ackermann, W. (1938) · Mathematische Annalen · doi:10.1007/bf01448924 · Cited by 10
Undecidability in physics: A review
Perales, Á., Cubitt, T. S., Gu, M., Pérez-García, D., & Wolf, M. M. (2025) · Physics Reports · doi:10.1016/j.physrep.2025.06.004 · Cited by 28
Semantics ofL(MT): a language for ecological modelling
Usó-Doménech, J. L., & Sastre‐Vazquez, P. (2002) · Kybernetes · doi:10.1108/03684920210422638 · Cited by 9
Logic and Order: Ontologic Effective Management for Learning and Creativity
Fiorini, R. A. (2017) · Advances in knowledge acquisition, transfer, and management book series/Advances in knowledge acquisition, transfer and management book series · doi:10.4018/978-1-5225-2443-4.ch011 · Cited by 11
Basti, G. (2017) · Studies in applied philosophy, epistemology and rational ethics · doi:10.1007/978-3-319-43784-2_9 · Cited by 8
“For this reason, and the subsequent fundamental demonstrations of Tarski’s theory of truth as correspondence (1929) [60], and of Gödel’s incompleteness theorems (1931) [61], the set-theoretic semantics migrated to higher-order logic, so to grant the total ordering of sets, by some foundation axiom, e.”
BackgroundMascareño, A. (2022) · Frontiers in Sociology · doi:10.3389/fsoc.2021.763453 · Cited by 15
“In this sense, communication is not complete, it does not resolve Gödel’s problem of incompleteness (Gödel, 1931), but because of this is dynamic and poietic −autopoietic−, always connecting one event to the next one in an infinite number of topics and contributions through which individuals and…”
BackgroundA cheater identifiable multi‐secret sharing scheme based on the Chinese remainder theorem
Chen, Z., Li, S., Zhu, Y., et al. (2015) · Security and Communication Networks · doi:10.1002/sec.1283 · Cited by 9
Non-Monotonic Set Theory as a Pragmatic Foundation of Mathematics
Verdée, P. (2012) · Foundations of Science · doi:10.1007/s10699-012-9296-5 · Cited by 9
Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings)
Tarau, P. (2013) · Theory and Practice of Logic Programming · doi:10.1017/s1471068413000537 · Cited by 9
Welcome to the Jungle. An Orientation Guide to the Disorder of Mathematics Education
Straehler-Pohl, H., Pais, A., & Bohlmann, N. (2016) · Springer eBooks · doi:10.1007/978-3-319-34006-7_1 · Cited by 9
Value Alignment, Fair Play, and the Rights of Service Robots
Estrada, D. (2018) · Proceedings of the AAAI/ACM Conference on AI Ethics and Society · doi:10.1145/3278721.3278730 · Cited by 13
“[Gödel 1931] Gödel, K. 1931.”
BackgroundDigital life, a theory of minds, and mapping human and machine cultural universals
Clark, K. B. (2020) · Behavioral and Brain Sciences · doi:10.1017/s0140525x19002838 · Cited by 9
Boolean Hypercubes: The Origin of a Tagged Recursive Logic and the Limits of Artificial Intelligence
Carbó‐Dorca, R. (2021) · Universal Journal of Mathematics and Applications · doi:10.32323/ujma.738463 · Cited by 9
Picollo, L. (2019) · Journal of Philosophical Logic · doi:10.1007/s10992-019-09524-w · Cited by 9
Traces of the Mouth: Andrei Andreyevich Markov's Mathematization of Writing
Link, D. (2006) · History of Science · doi:10.1177/007327530604400302 · Cited by 9
On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
Kikuchi, M., Kurahashi, T., & Sakai, H. (2012) · Mathematical logic quarterly · doi:10.1002/malq.201110067 · Cited by 9
On a uniform representation of combinators, arithmetic, lambda terms and types
Tarau, P. (2015) · International Symposium on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/2790449.2790526 · Cited by 9
Collimation processes in quantum mechanics interpreted in quantum real numbers
Corbett, J. V., & Durt, T. (2008) · Studies in History and Philosophy of Science Part B Studies in History and Philosophy of Modern Physics · doi:10.1016/j.shpsb.2008.07.006 · Cited by 10
Heterologicality and Incompleteness
Cieśliński, C. (2002) · Mathematical logic quarterly · doi:10.1002/1521-3870(200201)48:1 · Cited by 9
A Boolean derivation of the Moore-Osgood theorem
Blake, A. (1946) · Journal of Symbolic Logic · doi:10.2307/2266733 · Cited by 12
A Short Survey of Automated Reasoning
Harrison, J. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73433-8_24 · Cited by 11
“Gödel’s famous incompleteness theorems [40, 98, 37] show that formal systems for deducing mathematics have essential weaknesses.”
BackgroundMellor, D. H. (1983) · Journal of Graph Theory · doi:10.1002/jgt.3190070103 · Cited by 9
How secure is a Newtonian paradigm for psychological and educational measurement?
Cantley, I. (2014) · Theory & Psychology · doi:10.1177/0959354314561141 · Cited by 10
Conceptual Confluence in 1936: Post and Turing
Davis, M. D., & Sieg, W. (2015) · Springer eBooks · doi:10.1007/978-3-319-22156-4_1 · Cited by 13
A NOTE ON DERIVABILITY CONDITIONS
KURAHASHI, T. (2020) · Journal of Symbolic Logic · doi:10.1017/jsl.2020.33 · Cited by 9
“Gödel [8] stated his second incompleteness theorem with the consistency statement ConΦ.”
BackgroundPredicativism as a Philosophical Position
Hellman, G. P. (2004) · Revue internationale de philosophie · doi:10.3917/rip.229.0295 · Cited by 9
Some diophantine forms of gödel's theorem
Dyson, V. H., Jones, J. P., & Shepherdson, J. C. (1980) · Archive for Mathematical Logic · doi:10.1007/bf02318026 · Cited by 9
Chapter 16 A survey of recursive combinatorics
Gasarch, W. I. (1998) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(98)80049-9 · Cited by 9
Inductive learning and defeasible inference
Korb, K. B. (1995) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528139508953814 · Cited by 9
The consistency of the ramified Principia
Fitch, F. B. (1938) · Journal of Symbolic Logic · doi:10.2307/2267777 · Cited by 9
Rosser, J. B. (1993) · American Journal of Economics and Sociology · doi:10.1111/j.1536-7150.1993.tb02555.x · Cited by 11
Uncertainty in computer application is certain-software engineering as a control
Lehman, M. M. (2002) · doi:10.1109/cmpeur.1990.113659 · Cited by 9
Potter, M. (2004) · doi:10.1093/acprof:oso/9780199269730.003.0005 · Cited by 9
On arithmetic complexity of certain constructive logics
Plisko, V. E. (1992) · Mathematical Notes · doi:10.1007/bf01247653 · Cited by 9
A formal theory of quantum classification. — I
Golden, S. (1957) · Il Nuovo Cimento · doi:10.1007/bf02743934 · Cited by 9
Does Generosity Versus Creativity and Solidarity Matter within the Contemporary World Changes?Preprint
Bulz, N. (2010) · SSRN Electronic Journal · doi:10.2139/ssrn.1659286 · Cited by 8
Архитектура Метасистемы TATUNITY
Казанска, А. М. (2025) · doi:10.64357/tatunitymetasystemarchitecture · Cited by 8
Behavioral Ontology Part 1: A General Theory of Declarative Automation
Argibay, J. L. (2026) · The Scientific Review · doi:10.67486/tsr.2026.3 · Cited by 8
Mechanized Metatheory Revisited
Miller, D. (2018) · Journal of Automated Reasoning · doi:10.1007/s10817-018-9483-3 · Cited by 14
Journey of Artificial Intelligence
Kuipers, M., & Prasad, R. (2021) · Wireless Personal Communications · doi:10.1007/s11277-021-09288-0 · Cited by 17
Complexity and aesthetics: How arts, sciences, and economics coevolve
Rosser, J. B. (2022) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2022.111905 · Cited by 8
On the Arithmetic Complexity of the Bandwidth of Bandlimited Signals
Boche, H., Bock, Y. N., & Mönich, U. J. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3200907 · Cited by 8
Bozga, M. D., & Iosif, R. (2007) · Springer eBooks · doi:10.1007/978-3-540-69738-1_9 · Cited by 8
Usó-Doménech, J. L., & Villacampa, Y. (2001) · International Journal of General Systems · doi:10.1080/03081070108960726 · Cited by 8
Phenomenological-Semantic Investigations into Incompleteness
Wiegand, O. K. (2000) · Contributions to phenomenology · doi:10.1007/978-94-015-9446-2_8 · Cited by 8
Rojszczak, A., & Smith, B. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.013 · Cited by 12
Truth and Propositional Unity in Early Russell
Ricketts, T. G. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0006 · Cited by 9
Editors’ Review and Introduction: Lying in Logic, Language, and Cognition
van Ditmarsch, H., Hendriks, P., & Verbrugge, R. (2020) · Topics in Cognitive Science · doi:10.1111/tops.12492 · Cited by 17
Lorenzen's Proof of Consistency for Elementary Number Theory
Coquand, T., & Neuwirth, S. (2020) · History and Philosophy of Logic · doi:10.1080/01445340.2020.1752034 · Cited by 8
The Grossone Methodology Perspective on Turing Machines
Sergeyev, Y. D., & Garro, A. (2014) · Emergence, complexity and computation · doi:10.1007/978-3-319-09039-9_7 · Cited by 8
Hilbert’s Tenth Problem: Diophantine Equations in the Twentieth Century
Matiyasevich, Y. V. (2006) · Springer eBooks · doi:10.1007/3-540-29462-7_10 · Cited by 8
Halbach, V., & Visser, A. (2014) · Studies in universal logic · doi:10.1007/978-3-319-09719-0_17 · Cited by 8
In Defense of Logical Universalism: Taking Issue with Jean van Heijenoort
de Rouilhan, P. (2012) · Logica Universalis · doi:10.1007/s11787-012-0066-5 · Cited by 8
Sharp thresholds for hypergraph regressive Ramsey numbers
Carlucci, L., Lee, G., & Weiermann, A. (2010) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2010.08.004 · Cited by 8
“For f the identity function, the theorem has the notable property of being a Gödel sentence [4] for Peano Arithmetic [6] and is known as the Regressive Ramsey Theorem.”
Method
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.