home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!gatech!bloom-beacon!eru.mt.luth.se!lunic!sunic!sics.se!sics.se!torkel
- From: torkel@sics.se (Torkel Franzen)
- Newsgroups: sci.math
- Subject: Re: Stupid question about FLT
- Message-ID: <1992Jul21.085126.11887@sics.se>
- Date: 21 Jul 92 08:51:26 GMT
- References: <1992Jul18.005818.8468@infodev.cam.ac.uk>
- <1992Jul18.212618.15509@mixcom.com> <1992Jul18.224827.2167@sics.se>
- <1992Jul20.035836.4789@mixcom.com> <1992Jul20.080932.24570@sics.se>
- <MARTIN.92Jul20172809@lyra.cis.umassd.edu>
- Sender: news@sics.se
- Organization: Swedish Institute of Computer Science, Kista
- Lines: 14
- In-Reply-To: martin@lyra.cis.umassd.edu's message of 20 Jul 92 22:28:09 GMT
-
- In article <MARTIN.92Jul20172809@lyra.cis.umassd.edu>
- martin@lyra.cis.umassd.edu (Gary Martin) writes:
-
- >"Exactly like" in this context means "elementarily equivalent", not
- >"isomorphic".
-
- I might have assumed that the term "exactly like", which has no
- standard mathematical definition, here meant "elementarily eqivalent",
- had not the original author gone on to say that "in particular, there
- are always models containing natural numbers which are not represented
- by any terms of the language." So, whatever the original intention,
- I believe it should be pointed out, so as not to mislead anybody,
- that any consistent first order extension of PA will have models containing
- individuals not represented by any terms of the language.
-