Re: Enderton problem
- From: Gc <Gcut667@xxxxxxxxxxx>
- Date: Tue, 4 Dec 2007 13:03:16 -0800 (PST)
On 4 joulu, 02:34, dpo...@xxxxxxxxxxxxx wrote:
If you have Enderton's A Mathematical Introduction to Logic handy,
this problem comes from number 7 in chapter 2, section 6.
Consider a language with a two-place function predicate symbol <, and
let N = (N; <) be the structure consisting of the natural numbers with
their usual ordering. Show that there is some A elementarily
equivalent to N such that <A has a descending chain.
Okay, here's what I'm thinking. We let the domain of A be the set {1/
n : n in the natural numbers} and define (m, n) is in <A iff (n, m) is
in <N. So A appears to have a descending chain. Now I need to show
that A and N are elementarily equivalant. I can do this by showing A
is a model for ThN. But...how do I do this? Enderton suggests
applying the compactness theorem...but I'm not sure how this leads to
showing they are elementarily equivalent.
I don`t see why you can`t just take the non-positive integers M with
their usual ordering. That structure is isomorphic to the (N; <), so
it is also elementarily equivalent, which is a weaker property than
isomorphism but it is implied by it.
.
- Follow-Ups:
- Re: Enderton problem
- From: David C . Ullrich
- Re: Enderton problem
- References:
- Enderton problem
- From: dpowen
- Enderton problem
- Prev by Date: Re: Technical Animism
- Next by Date: Re: Just a small type theory.
- Previous by thread: Re: Enderton problem
- Next by thread: Re: Enderton problem
- Index(es):
Relevant Pages
|
