When does elementary bi-embeddability imply isomorphism?

Details When does elementary bi-embeddability imply isomorphism? When does elementary bi-embeddability imply isomorphism?

2007-05-13

arxiv.org/abs/0705.1849v1

Mathematics

Logic

24 pages

Scientific paper

A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is superstable and has NDOP and NOTOP) and satisfies a slightly stronger condition than nonmultidimensionality, namely: there cannot be a model M of T, a type p over M, and an automorphism f of M such that for every two distinct natural numbers i and j, f^i(p) is orthogonal to f^j(p). We also make some conjectures about how the class of theories with the Schroder-Bernstein property can be characterized.

Affiliated with

Also associated with

No associations

Rating

When does elementary bi-embeddability imply isomorphism? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with When does elementary bi-embeddability imply isomorphism?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and When does elementary bi-embeddability imply isomorphism? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-458144