Jump to content

End extension: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
No edit summary
CS1
Line 13: Line 13:
==Existence==
==Existence==


Keisler and Morley showed that every countable model of ZF has an end extension of which it is an [[elementary substructure]].<ref>H. Keisler, M. Morley, "Elementary extensions of models of set theory". In ''Israel Journal of Mathematics'' vol. 5 (1968), pp.49--65</ref> If the elementarity requirement is weakened to being elementary for formulae that are <math>\Sigma_n</math> on the [[Lévy hierarchy]], every countable structure in which <math>\Sigma_n</math>-collection holds has a <math>\Sigma_n</math>-elementary end extension.<ref>M. Kaufmann, "On existence of Σ<sub>n</sub> end extensions". In ''Lecture Notes in Mathematics: Logic Year 1979--80'' (1981), pp.92--103. ISBN 3-540-10708-8.</ref>
Keisler and Morley showed that every countable model of ZF has an end extension of which it is an [[elementary substructure]].<ref>{{citation
| last1=Keisler | first1=H. Jerome
| last2=Morley | first2=Michael
| title=Elementary extensions of models of set theory
| journal=[[Israel Journal of Mathematics]]
| volume=5
| date=1968
| pages=49–65
| doi=10.1007/BF02771605}}</ref> If the elementarity requirement is weakened to being elementary for formulae that are <math>\Sigma_n</math> on the [[Lévy hierarchy]], every countable structure in which <math>\Sigma_n</math>-collection holds has a <math>\Sigma_n</math>-elementary end extension.<ref>{{citation
| last1=Kaufmann | first1=Matt
| contribution=On existence of Σ<sub>n</sub> end extensions
| series=Lecture Notes in Mathematics
| title=Logic Year 1979–80
| date=1981
| pages=92–103
| isbn=3-540-10708-8
| volume=859
| doi=10.1007/BFb0090942}}</ref>


==References==
==References==

Revision as of 16:58, 28 August 2023

In model theory and set theory, which are disciplines within mathematics, a model of some axiom system of set theory in the language of set theory is an end extension of , in symbols , if

  1. is a substructure of , (i.e., and ), and
  2. whenever and hold, i.e., no new elements are added by to the elements of .

The second condition can be equivalently written as for all .

For example, is an end extension of if and are transitive sets, and .

A related concept is that of a top extension (also known as rank extension), where a model is a top extension of a model if and for all and , we have , where denotes the rank of a set.

Existence

Keisler and Morley showed that every countable model of ZF has an end extension of which it is an elementary substructure.[1] If the elementarity requirement is weakened to being elementary for formulae that are on the Lévy hierarchy, every countable structure in which -collection holds has a -elementary end extension.[2]

References

  1. ^ Keisler, H. Jerome; Morley, Michael (1968), "Elementary extensions of models of set theory", Israel Journal of Mathematics, 5: 49–65, doi:10.1007/BF02771605
  2. ^ Kaufmann, Matt (1981), "On existence of Σn end extensions", Logic Year 1979–80, Lecture Notes in Mathematics, vol. 859, pp. 92–103, doi:10.1007/BFb0090942, ISBN 3-540-10708-8