A Purely Algebraic Proof Of The Omitting Types Theorem
Abstract
In the present note we make use of some information given in [2]. Also, the terminology and notation do not dier from those accepted in [2]; in particular this concerns the formalism for the predicate calculus. Let A be a model of a rst-order language L. We say that A realizes a set of formulas Fla i A j= [a] for some valuation a in A and all 2 . We say that A omits i A does not realize . A formula 2 Fla is consistent with a theory T in i there is a model of T which realizes fg