Related papers: Beware of the G\"odel- Wette paradox
G\"odel's argument for the First Incompleteness Theorem is, structurally, a proof by contradiction. This article intends to reframe the argument by, first, isolating an additional assumption the argument relies on, and then, second, arguing…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…
A detailed and rigorous analysis of G\"odel's proof of his first incompleteness theorem is presented. The purpose of this analysis is two-fold. The first is to reveal what G\"odel actually proved to provide a clear and solid foundation upon…
In this essay we'll prove G\"odel's incompleteness theorems twice. First, we'll prove them the good old-fashioned way. Then we'll repeat the feat in the setting of computation. In the process we'll discover that G\"odel's work, rightly…
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…
An ultimate universal theory -- a complete theory that accounts, via few and simple first principles, for all the phenomena already observed and that will ever be observed -- has been, and still is, the aspiration of most physicists and…
The inconsistencies involved in the foundation of set theory were invariably caused by infinity and self-reference; and only with the opportune axiomatic restrictions could them be obviated. Throughout history, both concepts have proved to…
I present the proof of Goedel's First Incompleteness theorem in an intuitive manner, while covering all technically challenging steps. I present generalizations of Goedel's fixed point lemma to two-sentence and multi-sentence versions,…
The literature dealing with G\"{o}del's legacy is largely preoccupied with challenging his philosophical views, regarding them as outdated. We believe that such an approach prevents us from seeing G\"{o}del's views in the right light and…
G\"odel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand…
A proof of G\"odel's incompleteness theorem is given. With this new proof a transfinite extension of G\"odel's theorem is considered. It is shown that if one assumes the set theory ZFC on the meta level as well as on the object level, a…
A very short proof of G\"odel's second incompleteness theorem (for set theory, second order arithmetic etc.)
We show how G\"odel's first incompleteness theorem has an analog in quantum theory. G\"odel's theorem implies endless opportunities for appending axioms to arithmetic, implicitly showing a role for an agent, namely an agent that asserts an…
A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…
The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of…
A new viewpoint of the G\"odel's incompleteness theorem be given in this article which reveals the deep relationship between the logic and computation. Upon the results of these studies, an algorithm be given which shows how to search a…
A formalisation of G\"odel's incompleteness theorems using the Isabelle proof assistant is described. This is apparently the first mechanical verification of the second incompleteness theorem. The work closely follows {\'S}wierczkowski…
Most discussions of G\"odel's theorems fall into one of two types: either they emphasize perceived philosophical, cultural "meanings" of the theorems, and perhaps sketch some of the ideas of the proofs, usually relating G\"odel's proofs to…