Let be a nonprincipal partial type over a consistent first-order theory . Suppose is consistent, with a finite condition in finitely many new constants, and let be a tuple of closed terms. Some leaves consistent. Otherwise the original-language first-order formulais consistent with and entails every member of , contradicting nonprincipality. Replace all new constants occurring in the condition or terms by variables. This lemma makes the omission requirements dense in a countable Henkin construction.
Articles by others on the same topic
There are currently no matching articles.