Order Types of Ordinals in Models of Set Theory
Hutchinson, John E.
J. Symbolic Logic, Tome 41 (1976) no. 1, p. 489-502 / Harvested from Project Euclid
An ordinal in a model of set theory is truly countable if its set of predecessors is countable in the real world. We classify the order types of the sets of truly countable ordinals. Models with indiscernibles and other related results are discussed.
Publié le : 1976-06-14
Classification: 
@article{1183739792,
     author = {Hutchinson, John E.},
     title = {Order Types of Ordinals in Models of Set Theory},
     journal = {J. Symbolic Logic},
     volume = {41},
     number = {1},
     year = {1976},
     pages = { 489-502},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183739792}
}
Hutchinson, John E. Order Types of Ordinals in Models of Set Theory. J. Symbolic Logic, Tome 41 (1976) no. 1, pp.  489-502. http://gdmltest.u-ga.fr/item/1183739792/