Hostname: page-component-7dd5485656-bvgqh Total loading time: 0 Render date: 2025-10-29T23:46:23.679Z Has data issue: false hasContentIssue false
  • English
  • Français

Omitting types of prenex formulas

Published online by Cambridge University Press:  12 March 2014

C. C. Chang
C. C. Chang*
Affiliation:
University of California, Los Angeles
Get access Rights & Permissions [Opens in a new window]

Extract

In the literature, a type Γ is a set of formulas ϕ(ν0) in the one free variable ν0. A model M realizes Γ if there is an element a of M such that

M ╞ ϕ [a] for all ϕ ∈ Γ.

A model M omits Γ if no element of M realizes Γ. Evidently, the two statements:

(*) M realizes Γ

and

(**) M omits Γ

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 32 , Issue 1 , June 1967 , pp. 61 - 74
Copyright
Copyright © Association for Symbolic Logic 1967

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Chang, C. C., On the formula “there exists x such that f(x) for all ƒεF”, Notices of the American Mathematical Society, vol. 11 (1964), p. 587.Google Scholar
[2]Chang, C. C., Two refinements of Morle's method on omitting types of elements, Notices of the American Mathematical Society, vol. 11 (1964), p. 679.Google Scholar
[3]Chang, C. C., Ultraproducts and other methods of constructing models (notes by I. W. Harrison and A. B. Slomson), to appear in Sets, models, and recursion theory, Crossley, John, editor, North Holland, Amsterdam.Google Scholar
[4]Gaifman, Haim, Results concerning models of Peano's arithmetic, Notices of the American Mathematical Society, vol. 12 (1965), p. 377.Google Scholar
[5]Helling, Martin, Hanf numbers for some generalizations of first-order languages, Notices of the American Mathematical Society, vol. 11 (1964), p. 679.Google Scholar
[6]Keisler, H. J., The theory of models with generalized atomic formulas, this Journal, vol. 25 (1960), pp. 1–26.Google Scholar
[7]Keisler, H. J., Extending models of set theory, this Journal, vol. 30 (1965), p. 269.Google Scholar
[8]Keisler, H. J., Extending models of set theory. II, Notices of the American Mathematical Society, vol. 12 (1965), p. 244.Google Scholar
[9]Lindström, Per, On model completeness, Theoria, vol. 30 (1964), pp. 183–196.CrossRefGoogle Scholar
[10]MacDowell, R. and Specker, E., Modelle der Arithmetik, Infinitistic methods, Warsaw, 1959, pp. 257–263.Google Scholar
[11]Morley, M., Omitting classes of elements, The theory of models, North Holland, Amsterdam, 1965, pp. 265–273.Google Scholar
[12]Morley, M., Categoricity in power, Transactions of the American Mathematical Society, vol. 114 (1965), pp. 514–538.CrossRefGoogle Scholar
[13]Robinson, A., Introduction to model theory and to the metamathematics of algebra, North Holland, Amsterdam, 1963.Google Scholar
[14]Ryll-Nardzewski, C., On theories categorical in power ≤ℵ0, Bulletin de l'Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques, vol. 7 (1959), pp. 545–548.Google Scholar
[15]Tarski, A. and Vaught, R., Arithmetical extensions of relational systems, Compositie Mathematica, vol. 13 (1957), pp. 81–102.Google Scholar
[16]Vaught, R., Applications of the Löwenheim-Skolem-Tarski theorem to problems of completeness and decidability, Koninklijke Nederlandse Akademie van Wetenschappen, vol. 16 (1954), pp. 467–472.Google Scholar
[17]Vaught, R., Models of complete theories, Bulletin of the American Mathematical Society, vol. 69 (1963), pp. 299–313.CrossRefGoogle Scholar