definable type
Let be a first order structure.Let and be sets of parameters from .Let be a complete
-type over .Then we say that is an -definable type ifffor every formula
with ln,there is some formula and some parameters from so thatfor any from we have iff .
Note that if is a type over the model then this condition is equivalent to showing that is an -definable set.
For a type over , we say is definable if it is -definable.
If is definable, we call the defining formula for , and the function a defining scheme for .