Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Ordinals describable by a finite string of symbols
Replies: 24   Last Post: Jul 27, 2013 12:38 PM

 Messages: [ Previous | Next ]
 fom Posts: 1,968 Registered: 12/4/12
Re: Ordinals describable by a finite string of symbols
Posted: Jul 19, 2013 11:50 PM

On 7/19/2013 10:36 PM, apoorv wrote:
> On Tuesday, July 16, 2013 7:29:30 AM UTC+5:30, fom wrote:
>

>>
>> Anyway, I hope you find the links informative (don't go
>>
>> crazy trying to piece them together). I also hope that
>>
>>
>> than I have attempted

>
> Sometimes I find the thread going cold with me not really getting a clear answer to
> The issues raised.
> What is the godel number of the self referential sentence in godels theorem?
> And, if Sub( q,q,y) says that y is the godel number of the formula "q", with q substituted for the free variable,then the godel number of sub(q,q,y) would always be bigger than the godel number of q.. So how do we get equality for the self referential sentence?

There are those who are better than
I on Goedel's theorem and its consequences.

Good luck.

As I recall, the post in which I wrote
assignment of meaning....

Date Subject Author
7/10/13 Aatu Koskensilta
7/10/13 David C. Ullrich
7/10/13 Sandy
7/10/13 fom
7/12/13 apoorv
7/15/13 fom
7/16/13 Shmuel (Seymour J.) Metz
7/19/13 apoorv
7/19/13 fom
7/20/13 apoorv
7/20/13 Peter Percival
7/20/13 apoorv
7/21/13 apoorv
7/21/13 apoorv
7/21/13 fom
7/22/13 apoorv
7/22/13 fom
7/23/13 apoorv
7/23/13 apoorv
7/24/13 apoorv
7/27/13 apoorv
7/27/13 fom
7/10/13 Aatu Koskensilta