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

learn more… | top users | synonyms

2
votes
1answer
84 views

diagonalization about incompleteness

In the Enderton's logic book(page 186-187), he writes 'diagonalization approach' for proving undefinability of $\#Th\mathfrak{N}=\{\#\tau |\vDash_{\mathfrak{N}}\tau \}$ where $\#\tau$ is the godel ...
0
votes
1answer
29 views

Proving divergence of a sequence in a normed linear space

My aim is to prove that the space $(C_\mathbb{R}[0,1],||•||)$, where $||•||=\int_{0}^{1} t(1-t)|f(t)|dt$, is not complete. I have already proved that the sequence $(f_n)$ defined by $f_n(t)=\begin{...
5
votes
0answers
358 views

Gödel's Incompleteness Theorem in “Gödel, Escher, Bach”

Ok, so I'm reading the chapter on Gödel's Incompleteness Theorem in "Gödel, Escher, Bach" and I want to make sure I'm getting this right: the idea of the book's proof is to form the sentence "There ...
2
votes
0answers
44 views

Is the probabilitistic distribution of the digits in the Chaitin's constant computable?

The Chaitin constant can in principle be computed with exponential effort on each sucessive digit by brute forcing all programs of a given length and simply proving special theorems on each case that ...
1
vote
1answer
102 views

What is the mathematical meaning of this statement made by Gödel (see details)? [closed]

It appears as Proposition VI, in Gödel's 1931 paper "On Formally Undecidable Propositions in Principia Mathematica and Related Systems I" : "To every $\omega$-consistent recursive class $\kappa$ ...
4
votes
0answers
127 views

Incompleteness theorem

Correct me if I am wrong at any point! Godel's incompleteness theorem allows us to express "PA is consistent" in the language of Peano arithmetic, and shows that this is not provable in PA. Let's ...
1
vote
1answer
58 views

Why is the set of all true first-order statements about non-negative integers in the language with only equality, $+$ and $\times$ undecidable?

Apparently Tarski and Mostowski proved this, but intuitively I'm not seeing the difference between statements in a language of non-negative integers with equality, addition, and multiplication vs ...
9
votes
2answers
637 views

Is there a mistake in the SEP article about Godel's Incompleteness theorems?

Update: The mistake referred to in this question has now been corrected. The below refers to a previous version of the article: The second supplement to the Stanford Encyclopaedia of Philosophy ...
1
vote
1answer
87 views

Trouble Reading “On Formally Undecidable Propositions”

I've been working my way through Godel's original paper of the incompleteness theorem in my spare time, and I'm stuck with something stupidly simple. I'm looking at the list of 45 definitions of ...
9
votes
4answers
537 views

“The set of all true statements of first order logic”

In one of my lectures, the lecturer put a bunch of examples of sets on the board, stuff like the set of all humans, set of all well typed programs in some programming language, the set of all true ...
0
votes
1answer
97 views

Lindenbaum's Lemma

I am working on the proof of the Lindenbaum's lemma and there are some passages which are not very clear for me. Here is the statement: Let $\mathbb{L}$ a countable signature, $T$ a consistent set of ...
-1
votes
1answer
58 views

The existence of concatenation functions in Godel Numbering?

I know that there are many schema of Gödel Numbering, and each has its own method of Concatenation, n★m. But is there a general proof that shows 'For every Gödel Numbering scheme there exists a ...
11
votes
2answers
413 views

How to prove that Gödel's Incompleteness Theorems apply to ZFC?

Let us denote Robinson Arithmetic as Q and Primitive Recursive Arithmetic as PRA. Let $T$ be a formal theory formulated in the language of arithmetic. According to this page on the Stanford ...
3
votes
1answer
100 views

What does not having a first-order frame imply for models?

There are formulas in modal logic which which do not have a first-order frame condition, as stated here (Non-Sahlqvist formulas, Wikipedia). An example is the McKinsey formula for $p$: $$\Box\,\...
5
votes
1answer
162 views

Problem in Kunen - suitable representation of ZF proves the consistency of ZF?

I tried to prove the exercise problem in Kunen (Chapter IV, problem 36.) Problem. Show that there is a formula $\chi(x)$, such that $\chi$ represents ZF; i.e.,$$\phi\in \mathsf{ZF}\to \...
2
votes
1answer
172 views

$\omega$-consistent in Gödel I

In a very accessible form one could state the first incompleteness as follows: Incompleteness Theorem I Assume that $\textbf{PA}$ is consistent. Then there is a sentence $\phi$ such that $\textbf{...
1
vote
0answers
81 views

Importance of Gödel Numbering System

How important is Gödel numbering to his incompleteness proofs, set theory, logic theory in general and proofs employing ZFC? Can we use some other numbering or 'meta' programming? How about if one ...
2
votes
3answers
416 views

Can we prove that axioms do not contradict?

We construct many structures by chosing a set of axioms and deriving everything else from them. As far as I remember we never proved in our lectures that those axioms do not contradict. So: Is it ...
5
votes
1answer
390 views

About Godel Incompleteness and Multiplication

Godel proved that every system strong enough to include standard arithmetic with multiplication is incomplete. But I've read that systems that do not include multiplication are complete. But ...
4
votes
2answers
185 views

Is it possible to prove that some point belongs to Mandelbrot set? Is this an example of Gödel's theorem?

Everybody knows about Mandelbrot set drawing computer programs. Program takes some point, builds sequence from it, and if found that sequence goes out of circle with 2 radius, then knows that this ...
39
votes
7answers
4k views

Why is the Continuum Hypothesis (not) true?

I'm making my way through Thomas W Hungerfords's seminal text "Abstract Algebra 2nd Edition w/ Sets, Logics and Categories" where he makes the statement that the Continuum Hypothesis (There does not ...
0
votes
1answer
107 views

What does First Godel's Incompleteness theorem mean?

I am terribly confused what really "Incomplete" mean in terms of the Godel's theorem. Does it mean there are some theorems that are definable in First order theory of natural numbers and true but ...
1
vote
1answer
101 views

Uncountable reals in the theory

The Question I'm looking for a possibility to somehow proof the "essence" of Cantor's diagonal argument within a recursive first-order theory which is satisfied by the reals (better: within a theory ...
13
votes
6answers
17k views

What is the difference between Completeness and Soundness in first order logic?

Completeness is defined as if given $\Sigma\models\Phi$ then $\Sigma\vdash\Phi$. Meaning if for every truth placement $Z$ in $\Sigma$ we would get $T$, then $\Phi$ also would get $T$. If the previous ...
4
votes
2answers
399 views

Is it possible to deduce Godel's first incompleteness theorem from Chaitin's incompleteness theorem?

I want to ask if it is possible to deduce Godel's first incompleteness theorem from Chaitin's incompleteness theorem. I am reading the following AMS-Notice article. The authors claim that: The ...
9
votes
0answers
249 views

Fixed points in computability and logic

I asked this question on CS.SE, too: http://cstheory.stackexchange.com/questions/27322/fixed-points-in-computability-and-logic I would like to understand better the relation between fixed point ...
1
vote
1answer
110 views

Show that the metric $d_1$ on $C([0,1])$ does not give rise to a complete metric space. [duplicate]

Show that the metric $d_1$ on $C([0,1])$ does not give rise to a complete metric space. $$ d_1(f,g) = \int_0^1 |f(s)−g(s)| \, ds $$
0
votes
0answers
79 views

Questions about godel's first incompleteness theorem

I'd rather not get into the formal proof of godel's first incompleteness theorem. But I have 2 general questions. Looking at the statement from wikipedia: http://en.wikipedia.org/wiki/G%C3%B6del%...
1
vote
1answer
84 views

How can Goodstein's theorem be expressed in PA

I understand Goodstein's Theorem and its proof. I'm trying to understand the proof of why Goodstein's Theorem cannot be proved in PA. However, it's not immediately clear to me that Goodstein's Theorem ...
2
votes
1answer
408 views

True but unprovable?

I would like to ask a question about Gödel's Incompleteness Theorems which I've had in the back of my head for some time. Since I'm a student working in a completely different area of maths (my usual ...
4
votes
1answer
71 views

About Gödel's Incompleteness Theorem

A short time ago, I've been thinking about what statements in Number Theory are true but not provable. I've seen the proof of the Incompleteness Theorem (in the Gödel's works) and he gave an example ...
1
vote
1answer
68 views

Question about the incompleteness proof (Theorem V)

Question in short: Where do I find a complete proof of Theorem V from Gödels incompleteness proof? If it does not exists, can someone provide it? Question in detail: I am trying to understand ...
10
votes
1answer
263 views

Gödel's way of teaching non-standard models to Takeuti.

In Memoirs of a Proof Theorist, Gaisi Takeuti relates how Gödel taught him about nonstandard models in an "interesting" way: It went as follows. Let T be a theory with a nonstandard model. By ...
15
votes
1answer
780 views

Could it be that Goldbach conjecture is undecidable?

The result closest to Goldbach conjecture is Chen's theorem [Sci. Sinica 16 157–176], the proposition ``1+2''. It is natural to ask if it is likely that under our arithmetic axioms the Goldbach ...
3
votes
1answer
308 views

Problems with nesting proof predicates in first order logic.

Whenever I start nesting proof predicates, I always seems to run into these bizarre situations. I was wondering if anyone knows about this and could shed some light on it or provide me with some ...
4
votes
1answer
244 views

Proof of “If $ZFC$ proves there is an inaccessible cardinal, then $ZFC$ is inconsistent”.

Let $I$ be the statement "there is an inaccessible cardinal". I'm aware of two proofs of "If $ZFC\vdash I$ then $ZFC$ is inconsistent". One proof uses the Second Incompleteness Theorem, which I ...
1
vote
1answer
87 views

set theory, Incompleteness and axiomatic systems

Is the number of theorems that can be proved (decidable) within a certain set of axioms (for instance ZFC) is finite or infinite ? in other words, are we going to fully exhaust that set of axioms (...
1
vote
1answer
190 views

Criticism on truth of Gödel sentence in standard interpretation

Mendelson in his book mentioned the Gödel sentence and argued that in standard interpretation it is true. But Peter Milne in his article (On Godel Sentences and What They Say) criticized: "But we know ...
0
votes
1answer
86 views

Truth of Godel's sentence in standard interpretation

It is siad that the Godel's sentence: g is true in the standard interpretation. But I have problem in truth of g in the standard interpretation. We proved that if theory K is consistent g is not ...
1
vote
1answer
89 views

Boolean Algebra and Godel

Can anyone give an example of a theorem in Boolean Algebra that isn't immediately obvious to someone with a computer that can construct a truth table? Clearly no propisition that can be proved using ...
1
vote
0answers
112 views

Do we know that if $\pi$ is normal then there is a proof of it?

We do not know whether $\pi$ is normal or it is not and many other weaker statements, e.g. (*) $\pi$ contains infinitely many $0$s. Inspired by the Godel's incompleteness theorem that there are some ...
2
votes
2answers
300 views

Gödel's Incompleteness Theorem — meta-reasoning “loophole”?

Gödel's Theorem says that I can construct a mathematical statement like "f(x1,x2,...,x_n)=0 has no integer solution", where it is impossible (in a certain system of axioms) to formally prove that it's ...
4
votes
1answer
139 views

How can I imagine a model of $\mathsf{(ZF-Inf)} + \neg \mathsf{Con(ZF-Inf)}$?

Gödel's second incompleteness theorem states that if $\mathsf{ZF-Inf}$ is consistent, then $\mathsf{ZF-Inf} \nvdash \mathsf{Con(ZF-Inf)}$. Moreover, if $\mathsf{(ZF-Inf)} + \neg \mathsf{Con(ZF-Inf)}$ ...
0
votes
1answer
112 views

Godel's completeness theorem and formula that states consistency of ZF

Godel's completeness theorem, in original formulation, says that every logically valid statement/formula has finite deduction of a formula. Now then there is Godel's incompleteness theorem. Would this ...
2
votes
1answer
117 views

Expressibility of Gödel's Incompleteness Theorem

Can Gödel's Incompleteness Theorem be expressed as a formal sentence in ZFC and be proven formally or is it inherently meta-mathematical? (Note: I am referring to the theorem itself, not the ...
1
vote
2answers
58 views

Can two distinct formulae (or series of formulae) have the same Gödel number?

As I am studying Gödel's incompleteness theorem I am wondering if two distinct formulae or series of formulae can have the same Gödel number? Or the function mapping each formula or series of formulae ...
3
votes
1answer
128 views

Gödel's proof method and fundamental theorem of arithmetic

I am a novice to Gödel's proof (the theorem that consistency contradicts completeness), and, as it seems to me, he uses the fundamental theorem of arithmetic to uniquely number any formula. My ...
5
votes
1answer
97 views

If a statement holds for all standard models of PA, then does it hold for all models?

Suppose that $\varphi$ is a consequence of every standard model of PA. Then is it provable from PA?
0
votes
2answers
117 views

Scapegoat theory and PA

A theory T is scapegoat if for every formula A with only one free variable there exist a closed term s such that T proves: (∃x(¬A(x)))⇒¬A(s) I think it is an expectable property for each theory since ...
1
vote
0answers
68 views

What follows from Incompleteness about provability of partial correctness?

A colleague and I can't figure out what our professor is getting at with this question: What follows from the incompleteness theorems about the provability of partial correctness assertions? What ...