Journal of Symbolic Logic 64 (4):1689-1699 (1999)

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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586806
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,337
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
29 ( #394,724 of 2,507,897 )

Recent downloads (6 months)
1 ( #416,715 of 2,507,897 )

How can I increase my downloads?


My notes