Abstract
Let L(Q) be first order logic with Keisler's quantifier, in the λ + interpretation (= the satisfaction is defined as follows: $M \models (\mathbf{Q}x)\varphi(x)$ means there are λ + many elements in M satisfying the formula φ(x)). Theorem 1. Let λ be a singular cardinal; assume □ λ and GCH. If T is a complete theory in L(Q) of cardinality at most λ, and p is an L(Q) 1-type so that T strongly omits $p (= p$ has no support, to be defined in $\S1$ ), then T has a model of cardinality λ + in the λ + interpretation which omits p. Theorem 2. Let λ be a singular cardinal, and let T be a complete first order theory of cardinality λ at most. Assume □ λ and GCH. If Γ is a smallness notion then T has a model of cardinality λ + such that a formula φ(x) is realized by λ + elements of M iff φ(x) is not Γ-small. The theorem is proved also when λ is regular assuming $\lambda = \lambda^{ . It is new when λ is singular or when |T| = λ is regular. Theorem 3. Let λ be singular. If $\operatorname{Con}(ZFC + GCH + (\exists\kappa)$ [κ is a strongly compact cardinal]), then the following in consistent: ZFC + GCH + the conclusions of all above theorems are false