English
Related papers

Related papers: G\"odel's Theorem and Direct Self-Reference

200 papers

Not any geometry can be axiomatized. The paradoxical Godel's theorem starts from the supposition that any geometry can be axiomatized and goes to the result, that not any geometry can be axiomatized. One considers example of two close…

General Mathematics · Mathematics 2007-09-24 Yuri A. Rylov

A direct proof of the Steiner-Lehmus theorem has eluded geometers for over 170 years. The challenge has been that a proof is only considered direct if it does not rely on reductio ad absurdum. Thus, any proof that claims to be direct must…

Logic in Computer Science · Computer Science 2021-12-22 Ariel Kellison

Primitive recursion, mu-recursion, universal object and universe theories, complexity controlled iteration, code evaluation, soundness, decidability, G\"odel incompleteness theorems, inconsistency provability for set theory, constructive…

Logic · Mathematics 2015-04-14 Michael Pfender

In the article 'Ordinal Logics and the Characterizations of the Informal Concept of Proof', Georg Kreisel poses the problem of assigning unique notations to recursive ordinals, and additionally suggests that the methods which are developed…

Logic · Mathematics 2017-03-17 Matthew Timothy Wright

Some Goedel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. [Enriques lecture given…

History and Overview · Mathematics 2007-05-23 G. J. Chaitin

Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…

General Mathematics · Mathematics 2016-02-11 Giuseppe Raguní

This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…

General Mathematics · Mathematics 2010-02-25 J. A. Perez

In the paper it is demonstrated that Bells theorem is an unprovable theorem.

General Physics · Physics 2021-11-16 Han Geurdes , Koji Nagata , Tadao Nakamura , Ahmed Farouk

This is a 20-year old review on singularities and singularity theorems. The main reason to submit it now is -apart from increasing its availability- to correct a very strange error that appears in the journal's online version: it contains…

General Relativity and Quantum Cosmology · Physics 2018-01-17 José M. M. Senovilla

We introduce some early considerations of physical and mathematical impossibility as preludes to the Goedel incompleteness theorems. We consider some informal aspects of these theorems and their underlying assumptions and discuss some the…

History and Philosophy of Physics · Physics 2015-12-10 John D. Barrow

We prove that every non-circular D0L system contains arbitrarily long repetitions. This result was already published in 1993 by Mignosi and S\'e\'ebold, however their proof is only a sketch. We give here a complete proof. Further, employing…

Combinatorics · Mathematics 2014-01-03 Karel Klouda , Štěpán Starosta

It is a widespread belief that results like G\"odel's incompleteness theorems or the intrinsic randomness of quantum mechanics represent fundamental limitations to humanity's strive for scientific knowledge. As the argument goes, there are…

History and Philosophy of Physics · Physics 2021-08-30 Markus P. Mueller

This is a study of S. Kripke's notion of fulfilment. Motivated by Paris-Harrington statement, Kripke was looking for a proof of G\"odel's Incompleteness Theorem which was model-theoretic, natural (without self-reference), and easy.…

Logic · Mathematics 2019-04-25 J. E. Quinsey

This short squib looks at how using a broader definition of G\"odel numbering to mimic the accessibility relation between possible worlds results in two-world systems that sidestep undecidable sentences as well as the Liar paradox.

Logic · Mathematics 2018-05-23 Christopher F. S. Maligec

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

Logic · Mathematics 2017-05-22 Pavel Pudlak

In this paper, we give a detailed account of Goldfeld's proof of Siegel's theorem. Particularly, we present complete proofs of the nontrivial assumptions made in his paper.

Number Theory · Mathematics 2022-01-28 Zihao Liu

In this short paper, I present a few theorems on sentences of arithmetic which are related to Yablo's Paradox as G\"odel's first undecidable sentence was related to the Liar paradox. In particular, I consider two different arithemetizations…

Logic · Mathematics 2011-12-20 Graham Leach-Krouse

This paper engages the question "Does the consistency of a set of axioms entail the existence of a model in which they are satisfied?" within the frame of the Frege-Hilbert controversy. The question is related historically to the…

Logic · Mathematics 2021-05-03 Walter Dean

We revisit the issue of causality violations in G\"{o}del's universe, restricting to geodesic motions. It is well-known that while there are closed timelike curves in this spacetime, there are no closed causal geodesics. We show further…

General Relativity and Quantum Cosmology · Physics 2025-06-24 Brien C. Nolan

We investigate relationships between versions of derivability conditions for provability predicates. We show several implications and non-implications between the conditions, and we discuss unprovability of consistency statements induced by…

Logic · Mathematics 2021-07-01 Taishi Kurahashi
‹ Prev 1 4 5 6 7 8 10 Next ›