|Time:|| 12:00 - 13:20
Wean Hall 7201
Franklin and Marshall College
Superstable generic graphs with intrinsic transcendentals
We examine Hrushovski constructions in which the intrinsic closure of a finite set need not be contained in its algebraic closure, and examine conditions affecting the complexity of the resulting generic. In particular, certain configurations of intrinsic extensions will result in the essential undecidability of the resulting generic. For a fixed model M, we separate the types over M into those which are intrinsic and those which are extrinsic. We give a condition which limits the number of intrinsic types and proceed to demonstrate examples of such generics, ranging from superstable to unstable.