Type p(x) over A = consistent set of formulas. ω-saturated model realises all types. Omitting-types theorem: countable theory has model omitting given non-isolated type.
Type p(x) over A = consistent set of formulas. ω-saturated model realises all types. Omitting-types theorem: countable theory has model omitting given non-isolated type.