Abstract

When analyzing database query languages a roperty, of theories, the pseudo-finite homogeneity property, has been introduced and applied. We show that a stable theory has the pseudo-finite homogeneity property just in case its expressive power for finite states is bounded. Moreover, we introduce the corresponding pseudo-finite saturation property and show that a theory fails to have the finite cover property if and only if it has the pseudo-finite saturation property.