A general condition for collapse results (Q5957919): Difference between revisions

The paper deals with the mixture of finite and infinite model theory whose roots go back to database theory. Let \(L\) be a language containing \(<\), and \(T\) a complete \(L\)-theory containing the theory of linear orderings. Suppose \(\sigma\) is a finite non-empty set of relation symbols not contained in \(L\), and \(L(\sigma)=L\cup \sigma\). If \(M\) is an \(L\)-structure, and \(s\) is a tuple of finite relations on \(M\) such that \((M,s)\) is an \(L(\sigma)\)-structure, then \(s\) is called a \(\sigma\)-finite state in \(M\). We say that for \(T\) the collapse result holds if, for finite \(\sigma\)-states in models of \(T\), every \(L(\sigma)\)-formula preserved under partial \(<\)-isomorphisms is expressible in terms of \(<\) and the symbols in \(\sigma\). Some general sufficient conditions on \(T\) for the collapse are known. One of them, the so-called pseudo-finite homogeneity property, was suggested by \textit{O. V. Belegradek, A. P. Stolboushkin}, and \textit{M. A. Taitslin} [Ann. Pure Appl. Logic 97, 85-125 (1999; Zbl 0956.03035)]. \textit{J. Baldwin} and \textit{M. Benedikt} [Trans. Am. Math. Soc. 352, 4937-4969 (2000; Zbl 0960.03027)] proved the collapse result for any \(T\) without the independence property. It is not clear whether one of the two properties implies the other. The author suggests a (rather technical) version of the pseudo-finite homogeneity property, which implies the collapse result and holds for all \(T\) without the independence property. Note that the proof of the fact that the lack of the independence property implies the new property essentially depends on some Baldwin-Benedikt's result concerning indiscernible sequences in structures without the independence property.