Notre Dame Journal of Formal Logic

Models Omitting Given Complete Types

Akito Tsuboi
Source: Notre Dame J. Formal Logic Volume 49, Number 4 (2008), 393-399.

Abstract

We consider a problem of constructing a model that omits given complete types. We present two results. The first one is related to the Lopez-Escobar theorem and the second one is a version of Morley's omitting types theorem.

First Page: Show Hide
Primary Subjects: 03C50, 03C52
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1224257538
Digital Object Identifier: doi:10.1215/00294527-2008-019
Mathematical Reviews number (MathSciNet): MR2456655
Zentralblatt MATH identifier: 05657675

References

[1] Lopez-Escobar, E. G. K., ``An interpolation theorem for denumerably long formulas,'' Fundamenta Mathematicae, vol. 57 (1965), pp. 253--72.
Mathematical Reviews (MathSciNet): MR0188059
Zentralblatt MATH: 0137.00701
[2] Newelski, L., "Omitting types and the real line", The Journal of Symbolic Logic, vol. 52 (1987), pp. 1020--1026.
Mathematical Reviews (MathSciNet): MR916406
Zentralblatt MATH: 0636.03025
Digital Object Identifier: doi:10.2307/2273835
[3] Shelah, S., "The Hanf number of omitting complete types", Pacific Journal of Mathematics, vol. 50 (1974), pp. 163--68.
Mathematical Reviews (MathSciNet): MR0363877
Zentralblatt MATH: 0306.02048
Project Euclid: euclid.pjm/1102913702

2013 © University of Notre Dame

Notre Dame Journal of Formal Logic

Notre Dame Journal of Formal Logic

Turn MathJax Off
What is MathJax?