Ü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 201–300 of 2,380
Axioms in Mathematical Practice
Schlimm, D. (2013) · Philosophia Mathematica · doi:10.1093/philmat/nks036 · Cited by 49
Computation models and function algebras: Extended abstract
Clote, P. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60178-3_81 · Cited by 45
Closing the Circle: An Analysis of Emil Post's Early Work
Mol, L. D. (2006) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1146620062 · Cited by 43
Robinson, R. M. (1951) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1951-0041081-0 · Cited by 42
Asser, G. (1960) · Mathematical logic quarterly · doi:10.1002/malq.19600061506 · Cited by 42
Zhang, W.-R., & Peace, K. E. (2014) · Journal of Quantum Information Science · doi:10.4236/jqis.2014.44021 · Cited by 51
Bundy, A., Jamnik, M., & Fugard, A. J. B. (2005) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2005.1651 · Cited by 41
Neale, S. (2000) · Boston studies in the philosophy of science · doi:10.1007/978-94-011-3933-5_18 · Cited by 43
Sequences and Codes: Fundamentals of Biomolecular Cryptology
Konopka, A. K. (1994) · Elsevier eBooks · doi:10.1016/b978-0-08-092596-7.50008-3 · Cited by 45
Pennartz, C. M. A. (2022) · Behavioural Brain Research · doi:10.1016/j.bbr.2022.113969 · Cited by 40
Conventionalism, consistency, and consistency sentences
Warren, J. (2014) · Synthese · doi:10.1007/s11229-014-0626-8 · Cited by 41
Goldfarb, W. (2001) · Oxford University Press eBooks · doi:10.1093/019513916x.003.0002 · Cited by 41
Algorithmic Information Content, Church — Turing Thesis, Physical Entropy, and Maxwell’s Demon
Zurek, W. H. (1991) · NATO ASI series. Series B : Physics · doi:10.1007/978-1-4899-2305-9_20 · Cited by 40
The dialogue between the economic and the ecologic theories of evolution
Rosser, J. B. (1992) · Journal of Economic Behavior & Organization · doi:10.1016/0167-2681(92)90001-r · Cited by 40
Fifty years of self-reference in arithmetic.
Smoryński, C. (1981) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093883515 · Cited by 42
“It is now fifty years since Hans Hahn first presented an abstract of the then unknown Kurt Godel to the Vienna Academy of Sciences.”
BackgroundInfluentialClassification of Quantifier Prefixes Over Diophantine Equations
Jones, J. P. (1981) · Mathematical logic quarterly · doi:10.1002/malq.19810272504 · Cited by 40
Is complexity a source of incompleteness?
Calude, C. S., & Jürgensen, H. (2005) · Advances in Applied Mathematics · doi:10.1016/j.aam.2004.10.003 · Cited by 40
First experiments with PowerPlay
Srivastava, R. K., Steunebrink, B. R., & Schmidhuber, J. (2013) · Neural Networks · doi:10.1016/j.neunet.2013.01.022 · Cited by 50
Relations in Fuzzy Class Theory:
Běhounek, L., Bodenhofer, U., & Cintula, P. (2007) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2007.10.012 · Cited by 39
“This axiomatization is sufficient for almost all practi8 Due to G̈odel’s Incompleteness Theorem [37], since natural numbers are definable in Zadeh models over MTL 4.”
BackgroundComputation, behavior, and structure in fixed and growing automata
Burks, A. W. (2007) · Systems Research and Behavioral Science · doi:10.1002/bs.3830060103 · Cited by 39
Uncertainty principle of genetic information in a living cell
Strippoli, P., Canaider, S., Noferini, F., D’Addabbo, P., Vitale, L., Facchin, F., Lenzi, L., Casadei, R., Carinci, P., Zannotti, M., et al. (2005) · Theoretical Biology and Medical Modelling · doi:10.1186/1742-4682-2-40 · Cited by 37
Temporal Specifications with Accumulative Values
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014) · ACM Transactions on Computational Logic · doi:10.1145/2629686 · Cited by 49
Uher, J. (2014) · Integrative Psychological and Behavioral Science · doi:10.1007/s12124-014-9280-4 · Cited by 43
“Therefore, they cannot be rationally justified within the given system for which they are formulated (Gödel 1931) and are also called absolute presuppositions (Collingwood 1940).”
Theories of orders on the set of words
Kuske, D. (2005) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita:2005039 · Cited by 38
“Since (a∗, S, P ) ∼= (N,+, ·), this implies that the theory of M is undecidable [13].”
BackgroundSelf-reference and chaos in fuzzy logic
Grim, P. (1993) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.251925 · Cited by 40
The History and Concept of Computability
Soare, R. I. (1999) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(99)80017-2 · Cited by 47
Reflections on Church's thesis.
Kleene, S. C. (1987) · Notre Dame Journal of Formal Logic · doi:10.1305/ndjfl/1093637645 · Cited by 45
Using the Experimental Method to Produce Reliable Self-Organised Systems
Edmonds, B. (2005) · Lecture notes in computer science · doi:10.1007/11494676_6 · Cited by 37
Capitalism beyond Harmonious Equilibrium: Mathematics as If Human Agency Mattered
Bergmann, L. R., Sheppard, E., & Plummer, P. S. (2009) · Environment and Planning A Economy and Space · doi:10.1068/a411 · Cited by 38
Systems of Logic Based on Ordinals (1938)
Turing, A. M. (2004) · Oxford University Press eBooks · doi:10.1093/oso/9780198250791.003.0007 · Cited by 37
Self-Organization of Complex Systems
(2019) · Advances in religious and cultural studies (ARCS) book series · doi:10.4018/978-1-7998-1706-2.ch002 · Cited by 36
Chapter 1 Pure computable model theory
Harizanov, V. (1998) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(98)80002-5 · Cited by 37
Terminal model of Newtonian dynamics
Zak, M. A. (1993) · International Journal of Theoretical Physics · doi:10.1007/bf00674403 · Cited by 37
Ein Gültigkeitskriterium für die Sätze der klassischen Mathematik
Carnap, R. (1935) · Monatshefte für Mathematik · doi:10.1007/bf01733289 · Cited by 37
Some proofs of independence in axiomatic set theory
Mendelson, E. (1956) · Journal of Symbolic Logic · doi:10.2307/2269104 · Cited by 37
“We assume that all this has been done, as in [3], and we shall mention only a few of the arithmetized syntactical notions.”
BackgroundOn the Difficulties Involved in the Segmentation of Pictures
Gurari, E. M., & Wechsler, H. (1982) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1982.4767247 · Cited by 37
Relativistic quantum econophysics – new paradigms in complex systems modelling
Saptsin, V., & Соловйов, В. М. (2009) · doi:10.31812/0564/1134 · Cited by 44
Quantum information as the information of infinite seriesPreprint
Penchev, V. D. (2020) · Frenxiv (OSF Preprints) · doi:10.31226/osf.io/3t7y2 · Cited by 37
On The Logic Of Reducibility: Axioms And Examples
Niebergall, K.-G. (2000) · Erkenntnis · doi:10.1023/a:1005692729370 · Cited by 36
SELF-REFERENCE IN ARITHMETIC I
Halbach, V., & Visser, A. (2014) · The Review of Symbolic Logic · doi:10.1017/s1755020314000288 · Cited by 36
Uher, J. (2014) · Integrative Psychological and Behavioral Science · doi:10.1007/s12124-014-9281-3 · Cited by 38
Modal Logic and Self-Reference
Smoryński, C. (1984) · Springer eBooks · doi:10.1007/978-94-009-6259-0_9 · Cited by 36
The word problem and the isomorphism problem for groups
Stillwell, J. (1982) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1982-14963-1 · Cited by 36
Types in Logic, Mathematics and Programming
Constable, R. L. (1998) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(98)80025-6 · Cited by 36
Abstract Computability and Invariant Definability
Moschovakis, Y. N. (1970) · Journal of Symbolic Logic · doi:10.2307/2270854 · Cited by 36
Computability and Incomputability
Soare, R. I. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73001-9_75 · Cited by 35
Nondeterministic polynomial-time computations and models of arithmetic
Máté, A. (1990) · Journal of the ACM · doi:10.1145/78935.78941 · Cited by 35
Kienzler, W., & Grève, S. S. (2016) · Palgrave Macmillan UK eBooks · doi:10.1057/9781137472540_4 · Cited by 35
Kalmár, L. (1933) · Mathematische Annalen · doi:10.1007/bf01452848 · Cited by 35
Goodstein, R. L. (1957) · The Mathematical Gazette · doi:10.2307/3611534 · Cited by 35
Platzer, A. (2015) · ACM Transactions on Computational Logic · doi:10.1145/2817824 · Cited by 73
“Based on Gödel’s second incompleteness theorem [Gödel 1931], dL is incomplete [Platzer 2008, Theorem 2], and so is dGL.”
MethodSelf-Formalisation of Higher-Order Logic
Kumar, R., Arthan, R., Myreen, M. O., et al. (2016) · Journal of Automated Reasoning · doi:10.1007/s10817-015-9357-x · Cited by 34
Feferman, S. (1997) · Theoria · doi:10.1111/j.1755-2567.1997.tb00746.x · Cited by 34
Computation Models and Function Algebras
(1999) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(99)80033-0 · Cited by 39
Lissack, M. R., & Röös, J. (2001) · Long Range Planning · doi:10.1016/s0024-6301(00)00093-5 · Cited by 34
“Kurt Gödel proved that no “system” could be both complete and fully consistent.(45) The risks to a manager striving for coherence lie in the subtleties of Gödel’s observation.”
BackgroundOn Recursive Unsolvability of Hilbert's Tenth Problem
Matijasevič, Y. V. (1973) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(09)70352-0 · Cited by 34
Representing the knowledge of turing machines
Shin, H. S., & Williamson, T. L. (1994) · Theory and Decision · doi:10.1007/bf01079208 · Cited by 34
Logic, biology and automata-some historical reflections
Burks, A. W. (1975) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(75)80014-9 · Cited by 33
Effective Computation by Humans and Machines
Shagrir, O. (2002) · Minds and Machines · doi:10.1023/a:1015694932257 · Cited by 47
Constraint databases: A survey
Revesz, P. Z. (1997) · Lecture notes in computer science · doi:10.1007/bfb0035010 · Cited by 34
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
Soare, R. I. (1982) · Annals of Mathematical Logic · doi:10.1016/0003-4843(82)90016-x · Cited by 33
Various Aspects of Finite Quantum Automata
Hirvensalo, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85780-8_2 · Cited by 32
Undecidability of the Spectral Gap in One Dimension
Bausch, J., Cubitt, T. S., Lucia, Á., & Pérez-García, D. (2020) · Physical Review X · doi:10.1103/physrevx.10.031038 · Cited by 73
Batz, K., Kaminski, B. L., Katoen, J.-P., et al. (2021) · Proceedings of the ACM on Programming Languages · doi:10.1145/3434320 · Cited by 32
Gentzen's Proof Systems: Byproducts in a Work of Genius
von Plato, J. (2012) · Bulletin of Symbolic Logic · doi:10.2178/bsl/1344861886 · Cited by 32
Analysis of three multilevel security architectures
Levin, T. E., Irvine, C. E., Weissman, C., & Nguyen, T. D. (2007) · doi:10.1145/1314466.1314473 · Cited by 31
From Heisenberg to Gödel via Chaitin
Calude, C. S., & Stay, M. (2007) · International Journal of Theoretical Physics · doi:10.1007/s10773-006-9296-8 · Cited by 32
Robinson, A. (1973) · Journal of Symbolic Logic · doi:10.2307/2273049 · Cited by 32
Theory of Algorithms and Discrete Processors
Глушков, В. М., & Letichevskiĭ, A. A. (1969) · Springer eBooks · doi:10.1007/978-1-4615-9050-7_1 · Cited by 37
Intuitionist type theory and the free topos
Lambek, J., & Scott, P. J. (1980) · Journal of Pure and Applied Algebra · doi:10.1016/0022-4049(80)90102-4 · Cited by 32
Three universal representations of recursively enumerable sets
Jones, J. P. (1978) · Journal of Symbolic Logic · doi:10.2307/2272832 · Cited by 32
Philosophical implications of Tarski's work
Suppes, P. (1988) · Journal of Symbolic Logic · doi:10.2307/2274428 · Cited by 32
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
The Domain-Specificity of Creativity: Insights from New Phenomenology
Julmi, C., & Scherm, E. (2015) · Creativity Research Journal · doi:10.1080/10400419.2015.1030310 · Cited by 31
Witzany, G. (2020) · Frontiers in Astronomy and Space Sciences · doi:10.3389/fspas.2020.00007 · Cited by 34
“Philosophers and physicists such as Wittgenstein, Carnap, Goedel, Russell, and Tarski suggested that exact sciences are strictly based on exact scientific sentences describing empirical facts coherent with observations and measurements in experimental setups (Wittgenstein, 1922; Carnap, 1931, 1939; Gödel, 1931).”
BackgroundA survey of techniques for inference under uncertainty
Sheridan, F. K. J. (1991) · Artificial Intelligence Review · doi:10.1007/bf00129537 · Cited by 38
On the lengths of proofs of consistency
Pudlák, P. (1996) · Collegium Logicum : · doi:10.1007/978-3-7091-9461-4_5 · Cited by 31
Die Antinomien und die Unvollständigkeit der Mathematik
Carnap, R. (1934) · Monatshefte für Mathematik · doi:10.1007/bf01697862 · Cited by 31
Towards a Coherent Theory of Physics and Mathematics
Benioff, P. A. (2002) · Foundations of Physics · doi:10.1023/a:1016561108807 · Cited by 40
Turing’s Analysis of Computability, and Major Applications of It
Kleene, S. C. (1995) · Computerkultur · doi:10.1007/978-3-7091-6597-3_2 · Cited by 33
In memoriam kurt Gödel 28 April 1906-14 January 1978
Wang, H. (1978) · The Mathematical Intelligencer · doi:10.1007/bf03023270 · Cited by 31
Physics, biology, and sociology: A reappraisal
Rashevsky, N. P. (1966) · Bulletin of Mathematical Biology · doi:10.1007/bf02477000 · Cited by 31
Lieber Herr Bernays! Lieber Herr Gödel! Gödel on Finitism, Constructivity, and Hilbert's Program
Feferman, S. (2008) · dialectica · doi:10.1111/j.1746-8361.2008.01136.x · Cited by 30
The winter, the summer and the summer dream of artificial intelligence in law
Francesconi, E. (2022) · Artificial Intelligence and Law · doi:10.1007/s10506-022-09309-8 · Cited by 42
Nonlinear phenomena in spaces of algorithms
Burgin, M. (2003) · International Journal of Computer Mathematics · doi:10.1080/00207160310001606034 · Cited by 30
“For example, the famous G¨odel undecidability theorem (G¨odel, 1931) states that it is impossible to validate truth for all true statements about arithmetical objects.”
BackgroundUndefinability of truth. the problem of priority:tarski vs gödel
Murawski, R. (1998) · History and Philosophy of Logic · doi:10.1080/01445349808837306 · Cited by 30
FRY, W. F. (1987) · American Behavioral Scientist · doi:10.1177/000276487030003005 · Cited by 30
Kreisel, G. (1958) · Journal of Symbolic Logic · doi:10.2307/2964291 · Cited by 30
Personality in Political Psychology
Immelman, A. (2003) · Wiley eBooks · doi:10.1002/0471264385.wei0524 · Cited by 31
HEINRICH BEHMANN’S 1921 LECTURE ON THE DECISION PROBLEM AND THE ALGEBRA OF LOGIC
Mancosu, P., & Zach, R. (2015) · Bulletin of Symbolic Logic · doi:10.1017/bsl.2015.10 · Cited by 32
Maximally Consistent Sets of Instances of Naive Comprehension
Incurvati, L., & Murzi, J. (2017) · Mind · doi:10.1093/mind/fzv192 · Cited by 29
The logical analysis of language
Bell, D. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.014 · Cited by 29
The New AI: General & Sound & Relevant for Physics
Schmidhuber, J. (2007) · Cognitive technologies · doi:10.1007/978-3-540-68677-4_6 · Cited by 33
“Does it really deserve the attribute “new,” given that its roots date back to the 1930s, when Gödel published the fundamental result of theoretical computer science [16] and Zuse started to build the first general purpose computer (completed in 1941), and the 1960s, when Solomonoff and Kolmogorov published their first…”
BackgroundSlicing communicating automata specifications: polynomial algorithms for model reduction
Labbé, S., & Gallois, J.-P. (2008) · Formal Aspects of Computing · doi:10.1007/s00165-008-0086-3 · Cited by 29
The greatest mathematical paper of all time
Coleman, A. (1989) · The Mathematical Intelligencer · doi:10.1007/bf03025189 · Cited by 28
Ananth, P., Jain, A., Naor, M., et al. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53008-5_17 · Cited by 29
A consistent combinatory logic with an inverse to equality
Fitch, F. B. (1980) · Journal of Symbolic Logic · doi:10.2307/2273420 · Cited by 29
“It also contained elementary arithmetic in its entirety, avoiding arithmetical Godel incompleteness [14] by being a>-complete.”
BackgroundEin Verfahren der mathematischen Logik
Pepis, J. (1938) · Journal of Symbolic Logic · doi:10.2307/2267610 · Cited by 29
Wittgenstein’s conception of mind
McGinn, M. (2003) · Cambridge University Press eBooks · doi:10.1017/chol9780521591041.057 · Cited by 29
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.