{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T17:15:01Z","timestamp":1784308501471,"version":"3.55.0"},"reference-count":8,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":5215,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1999,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.2307\/2586806","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T14:03:57Z","timestamp":1146924237000},"page":"1689-1699","source":"Crossref","is-referenced-by-count":11,"title":["Pseudo-finite homogeneity and saturation"],"prefix":"10.1017","volume":"64","author":[{"given":"J\u00f6rg","family":"Flum","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Ziegler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200012846_ref002","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1980.90.11"},{"key":"S0022481200012846_ref001","unstructured":"Baldwin J.T. and Benedikt M. , Stability theory, permutations of indiscernibles, and embedded finite models, preprint."},{"key":"S0022481200012846_ref008","volume-title":"Classification theory","author":"Shelah","year":"1990"},{"key":"S0022481200012846_ref007","unstructured":"Casanovas E. and Ziegler M. , Stable theories with a new predicate, preprint."},{"key":"S0022481200012846_ref003","unstructured":"Belegradek O.V. , Stolboushkin A.P. , and Taitslin M.A. , Extended order-generic queries, preprint."},{"key":"S0022481200012846_ref004","first-page":"23","volume-title":"Helena Rasiowa in memoriam","volume":"46","author":"Belegradek","year":"1999"},{"key":"S0022481200012846_ref005","first-page":"5","article-title":"Relational expressive power of constraint query languages","author":"Benedikt","year":"1996","journal-title":"Journal of the ACM"},{"key":"S0022481200012846_ref006","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1996.561300"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200012846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T15:57:36Z","timestamp":1557417456000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200012846\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["S0022481200012846"],"URL":"https:\/\/doi.org\/10.2307\/2586806","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}