Expand the language by constants for every element of and a new tuple . Let be the elementary diagram of a structure associated with . Every finite subset ofis realized in the expansion of , because the finitely many formulas from are simultaneously satisfiable in . The compactness theorem gives a model of the whole set. The interpretations of the named constants give an elementary embedding , and the interpretation of realizes . Identifying with its image produces an elementary extension realizing . This is the finitely satisfiable type is realized in an elementary extension argument.
Articles by others on the same topic
There are currently no matching articles.