Godels theorem ends in paradox-simply proof
in [Logic]
|
Prev: A[x, y) by an algorithm of constant length
Next: Godels seconded theorem ends in paradox-simple proof
From: byron on 27 May 2010 01:15 it is shown by colin leslie dean that Godels theorem ends in paradox it is said godel PROVED "there are mathematical true statements which cant be proven" in other words truth does not equate with proof. if that theorem is true then his theorem is false PROOF for if the theorem is true then truth does equate with proof- as he has given proof of a true statement but his theorem says truth does not equate with proof. thus a paradox
From: byron on 27 May 2010 03:50 On May 27, 3:15 pm, byron <spermato...(a)yahoo.com> wrote: > it is shown by colin leslie dean that Godels theorem ends in paradox > > it is said godel PROVED > "there are mathematical true statements which cant be proven" > in other words > truth does not equate with proof. > > if that theorem is true > then his theorem is false > > PROOF > for if the theorem is true > then truth does equate with proof- as he has given proof of a true > statement > but his theorem says > truth does not equate with proof. > thus a paradox it is said by William Hughes Nope. Goedel showed Truth does not equate with derivation wrong godels theorem is about proof ie there are true mathematical which cant be proven note the word is proven not derivation this is the word version of his theorem note it talks about true statements which cant be proven--not derivation http://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems#First_incompleteness_theorem Gödel's first incompleteness theorem states that: Any effectively generated theory capable of expressing elementary arithmetic cannot be both consistent and complete. In particular, for any consistent, effectively generated formal theory that proves certain basic arithmetic truths, there is an arithmetical statement that is true,[1] but not provable in the theory (Kleene 1967, p. 250). thus it is shown by colin leslie dean that Godels theorem ends in paradox > > it is said godel PROVED > "there are mathematical true statements which cant be proven" > in other words > truth does not equate with proof. > > if that theorem is true > then his theorem is false > > PROOF > for if the theorem is true > then truth does equate with proof- as he has given proof of a true > statement > but his theorem says > truth does not equate with proof. > thus a paradox
From: Daryl McCullough on 27 May 2010 07:21 byron says... > >it is shown by colin leslie dean that Godels theorem ends in paradox > >it is said godel PROVED >"there are mathematical true statements which cant be proven" >in other words >truth does not equate with proof. > >if that theorem is true >then his theorem is false > >PROOF >for if the theorem is true >then truth does equate with proof- as he has given proof of a true >statement >but his theorem says >truth does not equate with proof. >thus a paradox You are not making any sense. Godel's theorem shows that not all true statements are provable. It doesn't say that *NO* true statements are provable. You need to learn this stuff from someone other than the Australian idiot, Colin Leslie Dean. -- Daryl McCullough Ithaca, NY
From: byron on 27 May 2010 23:41 On May 27, 9:21 pm, stevendaryl3...(a)yahoo.com (Daryl McCullough) wrote: > byron says... > > > > > > >it is shown by colin leslie dean that Godels theorem ends in paradox > > >it is said godel PROVED > >"there are mathematical true statements which cant be proven" > >in other words > >truth does not equate with proof. > > >if that theorem is true > >then his theorem is false > > >PROOF > >for if the theorem is true > >then truth does equate with proof- as he has given proof of a true > >statement > >but his theorem says > >truth does not equate with proof. > >thus a paradox > > You are not making any sense. Godel's theorem shows that > not all true statements are provable. It doesn't say that > *NO* true statements are provable. > > You need to learn this stuff from someone other than the > Australian idiot, Colin Leslie Dean. > > -- > Daryl McCullough > Ithaca, NY you say You are not making any sense. Godel's theorem shows that not all true statements are provable. It doesn't say that *NO* true statements are provable. fact is truth is not equated with proof poof of a statement cannot be in any way since godel a be regarded as makeing a statement true
From: byron on 27 May 2010 23:54
On May 28, 1:41 pm, byron <spermato...(a)yahoo.com> wrote: > On May 27, 9:21 pm, stevendaryl3...(a)yahoo.com (Daryl McCullough) > wrote: > > > > > byron says... > > > >it is shown by colin leslie dean that Godels theorem ends in paradox > > > >it is said godel PROVED > > >"there are mathematical true statements which cant be proven" > > >in other words > > >truth does not equate with proof. > > > >if that theorem is true > > >then his theorem is false > > > >PROOF > > >for if the theorem is true > > >then truth does equate with proof- as he has given proof of a true > > >statement > > >but his theorem says > > >truth does not equate with proof. > > >thus a paradox > > > You are not making any sense. Godel's theorem shows that > > not all true statements are provable. It doesn't say that > > *NO* true statements are provable. > > > You need to learn this stuff from someone other than the > > Australian idiot, Colin Leslie Dean. > > > -- > > Daryl McCullough > > Ithaca, NY > > you say > > You are not making any sense. Godel's theorem shows that > not all true statements are provable. It doesn't say that > *NO* true statements are provable. > > fact is truth is not equated with proof > poof of a statement cannot be in any way since godel a be regarded > as > makeing a statement true You are not making any sense. Godel's theorem shows that not all true statements are provable. It doesn't say that *NO* true statements are provable. fact is truth is not equated with proof poof of a statement cannot be in any way since godel a be regarded as makeing a statement true true statements in mathematics were generally assumed to be those statements which are provable in a formal axiomatic system. he works of Kurt Gödel, Alan Turing, and others shook this assumption, with the development of statements that are true but cannot be proven within the system http://en.wikipedia.org/wiki/Truth#Truth_in_mathematics In addition, from at least the time of Hilbert's program at the turn of the twentieth century to the proof of Gödel's theorem and the development of the Church-Turing thesis in the early part of that century, true statements in mathematics were generally assumed to be those statements which are provable in a formal axiomatic system. The works of Kurt Gödel, Alan Turing, and others shook this assumption, with the development of statements that are true but cannot be proven within the system |