Universality for Orders and Graphs Which Omit Large Substructures

Thompson, Katherine

Notre Dame J. Formal Logic, Tome 47 (2006) no. 1, p. 233-248 / Harvested from Project Euclid

Résumé

This paper will examine universality spectra for relational theories which cannot be described in first-order logic. We will give a method using functors to show that two types of structures have the same universality spectrum. A combination of methods will be used to show universality results for certain ordered structures and graphs. In some cases, a universal spectrum under GCH will be obtained. Since the theories are not first-order, the classic model theory result under GCH does not hold.

Publié le : 2006-04-14
Classification: universal model, posets, oriented graphs, orders, 03E05, 06A06

@article{1153858648,
     author = {Thompson, Katherine},
     title = {Universality for Orders and Graphs Which Omit Large Substructures},
     journal = {Notre Dame J. Formal Logic},
     volume = {47},
     number = {1},
     year = {2006},
     pages = { 233-248},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1153858648}
}

Thompson, Katherine. Universality for Orders and Graphs Which Omit Large Substructures. Notre Dame J. Formal Logic, Tome 47 (2006) no. 1, pp.  233-248. http://gdmltest.u-ga.fr/item/1153858648/