Hanf number of omitting type for simple first-order theories
- 1 September 1979
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 44 (3) , 319-324
- https://doi.org/10.2307/2273125
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 ℶ′ cannot be improved.Keywords
This publication has 3 references indexed in Scilit:
- Stability, the f.c.p., and superstability; model theoretic properties of formulas in first order theoryAnnals of Mathematical Logic, 1971
- Partition relations for cardinal numbersActa Mathematica Hungarica, 1965
- Homogeneous Universal Models.MATHEMATICA SCANDINAVICA, 1962