On 30 Aug 2009, at 18:55, Bruno Marchal wrote: >> > > Not at all. Most theories can formally determined their Gödel > sentences, and even bet on them. > They can use them to transform themselves into more powerful, with > respect to probability, machines, inheriting new Gödel sentences, and > they can iterate this in the constructive transfinite. A very nice > book is the "inexhaustibility" by Torkel Franzen.
I mean "povability". (the "b" is too much close to the "v" on my keyboard!) Sorry. > > Machine can determined their Gödel sentences. They cannot prove them, > but proving is not the only way to know the truth of a proposition. > The fact that G* is decidable shows that a very big set of unprovable > but true sentences can be find by the self-infering machine. found. I guess. I am so sorry for my english. http://iridia.ulb.ac.be/~marchal/ --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Everything List" group. To post to this group, send email to everything-list@googlegroups.com To unsubscribe from this group, send email to everything-list+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/everything-list?hl=en -~----------~----~----~----~------~----~------~--~---
