Pseudo-Finite Homogeneity and Saturation
Flum, Jorg ; Ziegler, Martin
J. Symbolic Logic, Tome 64 (1999) no. 1, p. 1689-1699 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
When analyzing database query languages a roperty, of theories, the pseudo-finite homogeneity property, has been introduced and applied (cf. [3]). 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.
Publié le : 1999-12-14
Classification:  
@article{1183745947,
     author = {Flum, Jorg and Ziegler, Martin},
     title = {Pseudo-Finite Homogeneity and Saturation},
     journal = {J. Symbolic Logic},
     volume = {64},
     number = {1},
     year = {1999},
     pages = { 1689-1699},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745947}
}

Flum, Jorg; Ziegler, Martin. Pseudo-Finite Homogeneity and Saturation. J. Symbolic Logic, Tome 64 (1999) no. 1, pp.  1689-1699. http://gdmltest.u-ga.fr/item/1183745947/