Graduate studies at Western
Journal of Symbolic Logic 44 (3):319-324 (1979)
|Abstract||Let T be a complete countable first-order theory such that every ultrapower of a model of T is saturated. If T has a model omitting a type p in every cardinality $ then T has a model omitting p in every cardinality. There is also a related theorem, and an example showing the $\beth_\omega$ cannot be improved|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
John P. Burgess (1978). On the Hanf Number of Souslin Logic. Journal of Symbolic Logic 43 (3):568-571.
Fred G. Abramson & Leo A. Harrington (1978). Models Without Indiscernibles. Journal of Symbolic Logic 43 (3):572-600.
Terrence Millar (1995). Model Completions and Omitting Types. Journal of Symbolic Logic 60 (2):654-672.
Julia F. Knight (1976). Hanf Numbers for Omitting Types Over Particular Theories. Journal of Symbolic Logic 41 (3):583-588.
Enrique Casanovas & Rafel Farré (1996). Omitting Types in Incomplete Theories. Journal of Symbolic Logic 61 (1):236-245.
Tarek Sayed Ahmed (2002). Martin's Axiom, Omitting Types, and Complete Representations in Algebraic Logic. Studia Logica 72 (2):285 - 309.
Rami Grossberg (1989). Models with Second Order Properties in Successors of Singulars. Journal of Symbolic Logic 54 (1):122-137.
Gilles Dowek & Benjamin Werner (2003). Proof Normalization Modulo. Journal of Symbolic Logic 68 (4):1289-1316.
Rami Grossberg (1991). Indiscernible Sequences in a Model Which Fails to Have the Order Property. Journal of Symbolic Logic 56 (1):115-123.
Rami Grossberg (1991). On Chains of Relatively Saturated Submodels of a Model Without the Order Property. Journal of Symbolic Logic 56 (1):124-128.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?