Re: Godel's Theorem and Model Theory
- From: stevendaryl3016@xxxxxxxxx (Daryl McCullough)
- Date: 3 Aug 2007 17:26:11 -0700
george says...
It is (as Daryl would be the first
to agree) the structure of a model, not the first-order sentences that
are true in it, that makes it standard or not.
Any denumerable model by definition can be put into
AN order that will match the standard.
The ordering of the elements is not inherent;
it is purely a matter of viewpoint.
If the models are elementarily equivalent then the sentences
of the theory are not even going to be able to express OR NOTICE
the ALLEGED (from the meta-view) difference in the order-type, so
it is simply not going to be relevant.
If the question is: Can a complete theory have
nonisomorphic models, then it would seem that
the fact the models are nonisomorphic is relevant.
That a complete first order theory can have two nonisomorphic
models (of the same cardinality) is a fact about models. Maybe
it's a lame fact, but it is a fact, and it answers the question
asked: Can the complete theory of arithmetic have a nonstandard
model? Yes, it can.
--
Daryl McCullough
Ithaca, NY
.
- Follow-Ups:
- Re: Godel's Theorem and Model Theory
- From: george
- Re: Godel's Theorem and Model Theory
- References:
- Re: Godel's Theorem and Model Theory
- From: george
- Re: Godel's Theorem and Model Theory
- Prev by Date: Re: Question: Given |X|>0 and |Y|>0, can X x Y be empty?
- Next by Date: Re: Question: Given |X|>0 and |Y|>0, can X x Y be empty?
- Previous by thread: Re: Godel's Theorem and Model Theory
- Next by thread: Re: Godel's Theorem and Model Theory
- Index(es):
Relevant Pages
|