End extension

From HandWiki
Short description: Extension of a transitive set

In model theory and set theory, a model 𝔅=⟨B,F⟩ of some axiom system of set theory T in the language of set theory is an end extension of 𝔄=⟨A,E⟩, in symbols 𝔄⊆end𝔅, if

  1. 𝔄 is a substructure of 𝔅, (i.e., A⊆B and E=F|A), and
  2. b∈A whenever a∈A and bFa hold, i.e., no new elements are added by 𝔅 to the elements of A.[1]

The second condition can be equivalently written as {b∈A:bEa}={b∈B:bFa} for all a∈A.

For example, ⟨B,∈⟩ is an end extension of ⟨A,∈⟩ if A and B are transitive sets, and A⊆B.

A related concept is that of a top extension (also known as rank extension), where a model 𝔅=⟨B,F⟩ is a top extension of a model 𝔄=⟨A,E⟩ if 𝔄⊆end𝔅 and for all a∈A and b∈B∖A, we have rank⁡(b)>rank⁡(a), where rank⁡(⋅) denotes the rank of a set.

Existence

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

References

  1. ↑ Keisler, H. Jerome; Silver, Jack H. (1971). "End extensions of models of set theory". in Scott, Dana. Axiomatic Set Theory. Proceedings of Symposia in Pure Mathematics. 13, Part 1. Providence, RI: American Mathematical Society. pp. 177–187. ISBN 0-8218-0245-3. 
  2. ↑ Keisler, H. Jerome; Morley, Michael (1968). "Elementary extensions of models of set theory". Israel Journal of Mathematics 6 (1): 49–65. doi:10.1007/BF02771605. 
  3. ↑ Kaufmann, Matt (1981). "On existence of Σn end extensions". in Lerman, M.; Schmerl, J. H.; Soare, R. I.. Logic Year 1979–80: University of Connecticut, USA. Lecture Notes in Mathematics. 859. Berlin, Heidelberg: Springer. pp. 92–103. doi:10.1007/BFb0090942. ISBN 978-3-540-10708-8.