A complete type is isolated when some formula belongs to no other complete type in . Equivalently, the basic open set determined by is the singleton .
A principal complete type is isolated by one first-order consistent first-order formula: modulo the first-order theory, that logical formula implies every member of the partial type. For complete types this is exactly an isolated type. The qualifier complete distinguishes this notion from partial types.
If a complete countable theory has a prime model, isolated types are dense in every finite-arity type space. Every nonempty basic open set is realized in the prime model, whose finite tuples have isolated types.
Articles by others on the same topic
There are currently no matching articles.