Abstract

We improve a general theorem of J. A. Makowsky which characterizes, for a wide class of languages, those sentences θ such that both $\operatorname{Mod}(\theta)$ and $\operatorname{Mod}(\neg\theta)$ are closed under unions of chains