Universality for Orders and Graphs Which Omit Large Substructures

Notre Dame Journal of Formal Logic 47 (2):233-248 (2006)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Forbidden subgraphs and forbidden substructures.Gregory Cherlin & Niandong Shi - 2001 - Journal of Symbolic Logic 66 (3):1342-1352.
A polarized partition relation using elementary substructures.Albin L. Jones - 2000 - Journal of Symbolic Logic 65 (4):1491-1498.
Stable structures with few substructures.Michael C. Laskowski & Laura L. Mayer - 1996 - Journal of Symbolic Logic 61 (3):985-1005.
.Jay Zeman - unknown
Democracy is a failure worthy of infinite repetition.Jon Simons - 2001 - Critical Horizons 2 (1):127-148.
On legal order: Some criticism of the received view. [REVIEW]Riccardo Guastini - 2000 - Ethical Theory and Moral Practice 3 (3):263-272.
Military Service in the Church Orders.Alan Kreider - 2003 - Journal of Religious Ethics 31 (3):415 - 442.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.

Analytics

Added to PP
2010-08-24

Downloads
15 (#919,495)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Club Guessing and the Universal Models.Mirna Džamonja - 2005 - Notre Dame Journal of Formal Logic 46 (3):283-300.
Small universal families for graphs omitting cliques without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.

Add more citations

References found in this work

Nonexistence of universal orders in many cardinals.Menachem Kojman & Saharon Shelah - 1992 - Journal of Symbolic Logic 57 (3):875-891.
Trees and Π 1 1 -Subsets of ω1 ω 1.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052 - 1070.
Trees and -subsets of ω1ω1.Alan Mekler & Jouko Väänänen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.
On universal graphs without instances of CH.Saharon Shelah - 1984 - Annals of Pure and Applied Logic 26 (1):75-87.
Independence results.Saharon Shelah - 1980 - Journal of Symbolic Logic 45 (3):563-573.

View all 7 references / Add more references