Model completions and omitting types

Journal of Symbolic Logic 60 (2):654-672 (1995)
  Copy   BIBTEX

Abstract

Universal theories with model completions are characterized. A new omitting types theorem is proved. These two results are used to prove the existence of a universal ℵ 0 -categorical partial order with an interesting embedding property. Other aspects of these results also are considered

Links

PhilArchive



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

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

Degree Spectra of Prime Models.Barbara F. Csima - 2004 - Journal of Symbolic Logic 69 (2):430 - 442.
Hanf number of omitting type for simple first-order theories.Saharon Shelah - 1979 - Journal of Symbolic Logic 44 (3):319-324.
Omitting types, type spectrums, and decidability.Terrence Millar - 1983 - Journal of Symbolic Logic 48 (1):171-181.
A new omitting types theorem for l(q).Matt Kaufmann - 1979 - Journal of Symbolic Logic 44 (4):507-521.
On certain types and models for arithmetic.Andreas Blass - 1974 - Journal of Symbolic Logic 39 (1):151-162.
Omitting types in incomplete theories.Enrique Casanovas & Rafel Farré - 1996 - Journal of Symbolic Logic 61 (1):236-245.

Analytics

Added to PP
2009-01-28

Downloads
26 (#596,950)

6 months
16 (#149,885)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
A decidable Ehrenfeucht theory with exactly two hyperarithmetic models.Robert C. Reed - 1991 - Annals of Pure and Applied Logic 53 (2):135-168.

Add more references