Questions about Gödel's incompleteness theorems and related topics.

learn more… | top users | synonyms

0
votes
0answers
34 views

Does Gödel sentence depend on numbering?

If we change Gödel's numbering definition of the $Prov$ predicate will change as well, but the meaning won't. How is that going to affect $G$? It seems to me like it will change as it is actually ...
1
vote
0answers
30 views

Is there a consistent arithmetically definable extension of PA that proves its own consistency?

Gödel's second incompleteness applies, for instance, to r.e. extensions of PA. I am wondering if it applies more generally to arithmetically definable extensions of PA. I see that there is a complete ...
1
vote
3answers
60 views

Gödel's Incompleteness Theorem and Numerical Analysis

I am no expert in Mathematical Logic so I can't really express my question formally but I do hope that it will make sense. As far as I know the implication of Gödel's incompleteness theorem for ...
2
votes
1answer
32 views

Does the existence of uncomputable functions imply that a theory is incomplete?

For example Kolmogorov complexity is uncomputable and Chaitin used that fact to prove incompleteness. If this is not the case, can you give me a counter example? Set of axioms is countable.
2
votes
2answers
60 views

Trying to understand self-reference as it relates to Godel's Second Incompleteness Theorem

As noted in this post, I'm trying to understand how a sufficiently powerful consistent theory $T$ can prove statements about itself without contradicting Godel's Second Incompleteness Theorem. Let ...
0
votes
2answers
65 views

Is it possible to formalize $T \models \sigma$ within the deductive calculus?

I know that the notion of $T \vdash \sigma$ is formalizable within any sufficiently powerful theory $T$ but is $T \models \sigma$ formalizable as well? How is this possible if there are infinitely ...
3
votes
2answers
80 views

What is wrong with this deduction of $\text{ZF} \vdash \text{Cons ZF}$

I realize from the answer to this post that the fallacy in my "proof" of "ZF is inconsistent" was that I was not considering that there are models with non-standard integers. However now I think I ...
1
vote
2answers
48 views

What does this deduction involving provability imply?

I recently asked this question asking why my reasoning for ZF being inconsistent was wrong. I didn't realize that we have to account for models with non-standard integers. However, I'm left with the ...
7
votes
1answer
80 views

What's wrong with this proof of ZF being inconsistent?

I'm studying (independently) mathematical logic and in investigating self-referential statements I developed a result which I don't know how to interpret. I'll use the notation from Enderton's "A ...
0
votes
1answer
93 views

Analogy between a Gödelian puzzle and Gödel's first incompleteness theorem

I'm studying Gödel's incompleteness theorems. And I have the following slide that defines a version of Gödel's first incompleteness theorem. The point is that one can always follow the math and get ...
0
votes
2answers
66 views

How can Godel's theorem apply to every formal system?

How can Godel's theorem apply to any formal system of logic, if the truth of the theorem itself is only relative to the axioms and rule of inference that were used to generate it. In other words ...
1
vote
2answers
75 views

How does Gödel's second incompleteness apply to any theory containing arithmetic?

If I understand correctly, there are two facts proven by Gödel's second incompleteness theorem, for a formal theory containing arithmetic 1) It is possible to express the consistency of the theory ...
1
vote
1answer
38 views

Expanding arithmetic to a complete theory by a transfinite sequence of expansions.

We all know that Godel first incompleteness theorem states that any recursive sufficiently strong theory to express arithmetic is incomplete. in particular, arithmetic is not complete. It's common ...
0
votes
1answer
49 views

Gödel's Incompleteness theorem in modal logic

I think I once taught that the statement of the Gödel's Incompleteness theorem is equivalent to : $ \diamond \neg \square \square p $, if p is a complex enough system. Is this right?
2
votes
1answer
48 views

Is there a result for second-order theories analogous to Gödel's second incompleteness theorem?

One formulation of Gödel's second theorem says that, if $T$ is a consistent, axiomatisable extension of $PA$, and then $T$ cannot prove $\neg Prv(\ulcorner 0=1 \urcorner)$, where $Prv(-)$ is a ...
0
votes
0answers
26 views

Arithmoquine function in Gödel's proof

Could someone explain as detailed as possible how the Arithmoquine{a,a'} function works or is the defined in Gödel's proof of the incompleteness theorem? To describe my question better... In this ...
5
votes
2answers
755 views

What does Gödel's Incompleteness Theorem prove?

Does Gödel's incompleteness theorem only prove that you can't have a formal system which describes number theory which is both complete and consistent, or is it more general? In other words: does it ...
0
votes
1answer
30 views

How to show factorial is recursive?

In my textbook Fact : Given recursive $G:\omega^{n}\rightarrow\omega$ and $H:\omega^{2}\times\omega^{n}\rightarrow\omega$ , a function $F:\omega\times\omega^{n}\rightarrow\omega$ defined by ...
1
vote
1answer
52 views

understanding gödel's 1931 paper - number theoritical formulae

I am reading a translation of Gödel's original paper about in completeness theorem and there are a couple things i don't understand. Here is the document i am using primarily : ...
1
vote
0answers
22 views

How to show that F is recursive?

In the road to Godel's incompleteness theorem, Problem saying: Show that Frame For $G:\omega\times\omega\times\omega^{n}\rightarrow\omega$ a recursive function, the function ...
0
votes
1answer
44 views

Can any statement about natural numbers be written in TNT?

I was trying to understand Godel's theorem from here Godel's First Incompleteness theorem. I still do not completely understand the theorem, but have a broad idea about it. As the link mentions ...
1
vote
1answer
30 views

What is the diagonalization of ‘∀x¬Gdl(x,y)'?

Correct me if I am wrong here.‘∀x¬Gdl(x,y)' simply states that There does not exist godel number for a given number y, right? So if we say that there exist a diagonalization of ‘∀x¬Gdl(x,y)', then we ...
6
votes
1answer
89 views

How do inconsistent arithmetics get around Gödel incompleteness?

Gödel theorems imply that arithmetic can not be complete under recursive axiomatization and consistency assumptions. Unexpectedly, consistency can be dropped in a meaningful way by switching to a ...
4
votes
1answer
70 views

Proving that the existence of strongly inaccessible cardinals is independent from ZFC?

ZFC can't prove that strongly inaccessible cardinals exist, or else it would prove that a model of itself exists and hence $Con(ZFC)$. So this leaves us with two options: ZFC proves there are no ...
5
votes
0answers
51 views

Vaught's essentially undecidable set theory

Today I was reading this paper, which includes discussion of essential undecidability of various weak theories. On page 24, I was surprised to find out that Vaught has showed that set theory with the ...
0
votes
1answer
68 views

Concerning the canonical example for Gödel's first incompleteness theorem

Concerning the canonical example for Gödel's first incompleteness theorem: G cannot be proved within the theory T If G were provable under the axioms and rules of inference of T, then T would ...
3
votes
2answers
47 views

Gödel's theorems and nonstandard model of $PA$

According to the Second incompleteness theorem $Con(PA)$ is independent of $PA$. So if $PA$ is consistent $PA + \neg Con(PA)$ is also consistent which means that there exist a number $t$ which codes a ...
0
votes
1answer
88 views

understanding gödel's 1931 paper - elementary formulae

I am trying to understand Gödel's first incompleteness theorem from his original 1931 paper. Here is a translation i am using for my studies : ...
0
votes
1answer
57 views

understanding gödel's 1931 paper - proof of theorem / proposition V 5

I am trying to fully understand gödel's proof of the first incompleteness theorem from it's original 1931 paper. Here is the document I am using : ...
0
votes
0answers
37 views

Standard model of the Meta theory in the proof of arithmetic incompleteness

I have a question about the incompleteness of arithmetic. I wonder in which meta theory we are reasoning. For example, if we are in ZFC, then there are some non standard models of ZFC. As far as I ...
0
votes
0answers
20 views

Completeness of the space $C_{2\pi} \left ( \mathbb{R} \right )$ [duplicate]

Denote $C_{2\pi} \left ( \mathbb{R} \right )$ is the set of complex-value, continuous on $\mathbb{R}$, periodic functions with period $2\pi$. Fix $p \in \left [1, \infty \right )$. For each $x \in ...
3
votes
1answer
142 views

understanding gödel's 1931 paper - the undecidability theorem

I am reading a translation of Gödel's original paper about in completeness theorem and there are a couple things i don't understand. Here is the document i am using primarily : ...
1
vote
1answer
59 views

Infinitely many nonequivalent unprovable statements in ZFC because of Gödel's incompleteness theorem?

Am I right in thinking that there are countably infinitely many nonequivalent unprovable statements in ZFC due to the Gödel's first incompleteness theorem? If not, why?
11
votes
2answers
123 views

Proportion of true statements that are provable

In an axiomatic system, there are true statements, some but not all of which are provable. Is there any sense in which we can quantify the proportion of those statements that are true? Here's an ...
1
vote
3answers
118 views

[Paradox]How can Godel prove that Godel sentence is unprovable but true, if such proof itself proves that Godel sentence is true?

Isn't the proof that Godel sentence is unprovable but true a proof itself that Godel sentence is true? Godel in the preface of his proof remarked: “From the remark that [the unprovable statement] ...
3
votes
2answers
89 views

understanding gödel's 1931 paper - primitive recursive functions - projection and equality

I am reading a translation of gödel's original, and i'm a bit confused about the primitive recursive functions. Everywhere on the internet (or some resources like courses/classes i could put my hands ...
2
votes
2answers
90 views

understanding gödel's 1931 paper - gödel numbers

I am a little confused about gödel numbers and what numbers exactly we are manipulating. are the numbers "real" natural numbers (than we obviously represent as) 1, 2, ... or are we always dealing ...
0
votes
1answer
38 views

Godel's Incompleteness Theorem and Algorithms [closed]

According to Godel's incompleteness theorem, not every problem can be solved using algorithms. How do we know if a problem can be solved using algorithm? How do we know that NP problems are ...
0
votes
1answer
55 views

understanding gödel's 1931 paper - primitive recursive functions “FR(x)” and “n Gl x”

I am trying very hard to fully understand gödel's paper on the incompleteness theorem. I have a slight technical question about one of the 45 primitive recursive functions introduced to build the ...
1
vote
1answer
50 views

What's wrong with this proof that ZFC is consistent

If we take ZFC minus all it's axioms, we can easily prove that ZFC's first axiom is independent (because all statements are independent in a formal system without any axioms). We can then prove that ...
1
vote
1answer
29 views

Will assuming an undecidable statement result in a consistent system?

If you assume that an undecidable statement in a consistent axiomatic system is true (or false), will that new system also be consistent? For example, does $\mathsf{ZF}$ being consistent imply that ...
2
votes
1answer
148 views

What does a Godel sentence actually look like?

My understanding is that Godel's first theorem says that there is a sentence that is in a sense true in a formal system F but cannot be derived in that system. I then hear that Godel actually goes on ...
4
votes
2answers
113 views

$L$ models set theory and so does $V_\kappa$ for $\kappa$ inaccessible

Background: I have been reading the 1980 edition of Kunen. Theorem VI.2.1 states it is provable from ZF that $\mathbf L$ (Kunen writes classes in bold) is a model of ZF. Also, it is a well-known ...
11
votes
4answers
1k views

How does Gödel Completeness fail in second-order logic?

So a while ago I saw a proof of the Completeness Theorem, and the hard part of it (all logically valid formulae have a proof) went thusly: Take a theory $K$ as your base theory. Suppose $\varphi$ ...
0
votes
1answer
49 views

Does the Law of the Excluded Middle imply syntactical completeness?

The Law of the Excluded Middle (LEM) states that for any proposition $p$, we have $\vdash p \lor \lnot p $. Syntactic completeness (a.k.a negation completeness) states that for any proposition $p$, ...
2
votes
1answer
67 views

$\mathrm{NBG}$ proves its own consistency

In $\mathrm{NBG}$, one can construct a model of $\mathrm{ZFC}$: $V$, the class containing every set. Thus: $\mathrm{NBG}$ can prove "$\mathrm{ZFC}$ is consistent". Furthermore, the following ...
3
votes
1answer
40 views

Consistency hierarchy between models with many urelements

The axiom of extensionality can be weakened, asking only for non-empty sets with the same elements to be equal. Then there can be many "different empty sets" called urelements. I call this theory ZFU ...
3
votes
2answers
153 views

Could someone show me a simple example of something being proved unprovable?

Could someone show me a simple example of something being proved unprovable? Pretty much what the title says, I want to understand a proof of some statement being proved unprovable. E: Please read ...
0
votes
1answer
51 views

Is there some result that says a theory cannot prove the consistency of any of its extensions?

Is there some result that says a (sufficiently strong) theory cannot prove the consistency of any of its extensions? Or something along these lines?? More generally, is there a result that says a ...
0
votes
1answer
29 views

What does it mean to encode some statement in Theory of Natural Numbers $Th(\mathbb{N})$?

For example Godel's Incompleteness Theorem says "Some statement in $Th(\mathbb{N})$ has no proof". Consider sentence "This sentence is not provable". We can encode this sentence in $Th(\mathbb{N})$. ...