Hi Jesse:

My originating post appeals only to the result of Turing to the effect that there is in general no decision procedure.

As a result FAS in general can not be both complete and consistent.

Since my All contains all FAS including the complete ones then the All is inconsistent. That is the simplicity of it.

As to any confusion over the concept of "model" I can call just as well call it a theory.


At 02:40 PM 12/6/2004, you wrote:
Hal Ruhl wrote:

To answer these questions it seems necessary to inject information into your theory beyond what may already be there - the sentences - ...

Right. This indeed follows from Goedel's incompleteness.

Here you appear to me to be saying that your theory is indeed subject to random external input.

"Random" because we do not know if the set of sentences is consistent in its current state and if incomplete it can be added to. How can it be added to in a manner that is consistent with the existing state? .

We can choose whether a Godel statement should be judged true or false by consulting our "model" of arithmetic. See this post of mine on the use of "models" in mathematics from the thread "Something for Platonists" (you can see the other posts in the thread by clicking 'View This Thread' at the top):



Reply via email to