Pseudo-finite homogeneity and saturation-Reference-Cited by-同舟云学术

Pseudo-finite homogeneity and saturation

Published:1999-12 Issue:4 Volume:64 Page:1689-1699
ISSN:0022-4812
Container-title:Journal of Symbolic Logic
language:en
Short-container-title:J. symb. log.

Author:

Flum Jörg,Ziegler Martin

Abstract

AbstractWhen 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.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference8 articles.

1. Ramsey quantifiers and the finite cover property

2. Baldwin J.T. and Benedikt M. , Stability theory, permutations of indiscernibles, and embedded finite models, preprint.

3. Casanovas E. and Ziegler M. , Stable theories with a new predicate, preprint.

4. Belegradek O.V. , Stolboushkin A.P. , and Taitslin M.A. , Extended order-generic queries, preprint.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Embedded Finite Models beyond Restricted Quantifier Collapse;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Data Path Queries over Embedded Graph Databases;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12

3. The Past and Future of Embedded Finite Model Theory;Lecture Notes in Computer Science;2022

4. Logical definability and query languages over ranked and unranked trees;ACM Transactions on Computational Logic;2007-04

5. Definable relations and first-order query languages over strings;Journal of the ACM;2003-09