Geodesic
The collapse theorem for theories of $I$-reducible algebraic systems
Izvestiya. Mathematics , Tome 68 (2004) no. 5, pp. 911-933.

Voir la notice de l'article provenant de la source Math-Net.Ru

We study $I$-reducible algebraic systems and the theory of $I$-reducible systems. We show that the lack of an independent formula in a theory is not a necessary condition for the $I$-reducibility of its models, even for extensions of Presburger arithmetic. In particular, there is an entire class of theories that are extensions of Presburger arithmetic in which there is an independent formula and which have $I$-reducible models. We show that the $I$-reducibility of a small algebraic systems automatically implies that every formula is equivalent in it to a $P$-restricted formula, and thus the collapse theorem holds for the theories of such systems. 
@article{IM2_2004_68_5_a2,
     author = {S. M. Dudakov},
     title = {The collapse theorem for theories of $I$-reducible algebraic systems},
     journal = {Izvestiya. Mathematics },
     pages = {911--933},
     publisher = {mathdoc},
     volume = {68},
     number = {5},
     year = {2004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/IM2_2004_68_5_a2/}
}
TY  - JOUR
AU  - S. M. Dudakov
TI  - The collapse theorem for theories of $I$-reducible algebraic systems
JO  - Izvestiya. Mathematics 
PY  - 2004
SP  - 911
EP  - 933
VL  - 68
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IM2_2004_68_5_a2/
LA  - en
ID  - IM2_2004_68_5_a2
ER  - 
%0 Journal Article
%A S. M. Dudakov
%T The collapse theorem for theories of $I$-reducible algebraic systems
%J Izvestiya. Mathematics 
%D 2004
%P 911-933
%V 68
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IM2_2004_68_5_a2/
%G en
%F IM2_2004_68_5_a2
S. M. Dudakov. The collapse theorem for theories of $I$-reducible algebraic systems. Izvestiya. Mathematics , Tome 68 (2004) no. 5, pp. 911-933. http://geodesic.mathdoc.fr/item/IM2_2004_68_5_a2/

[1] Baldwin J., Benedikt M., “Stability theory, permutations of indiscernibles, and embedded finite models”, Trans. Amer. Math. Soc., 352:11 (2000), 4937–4969 | DOI | MR | Zbl

[2] Belegradek O. V., Stolboushkin A. P., Taitslin M. A., “Extended order-generic queries”, Annals of Pure and Applied Logic, 97 (1999), 85–125 | DOI | MR | Zbl

[3] Benedikt M., Dong G., Libkin L., Wong L., “Relational expressive power of constraint query languages”, Proc. 15th ACM Symp. on Principles of Database Systems, 1996, 5–16

[4] Bulos Dzh., Dzheffri R., Vychislimost i logika, Mir, M., 1994

[5] Chang C. C., Keisler H. J., Model Theory, North Holland, Amsterdam, 1990 | MR | Zbl

[6] Shelah S., Classification theory and the number of non-isomorphic models, North Holland, Amsterdam, 1990 | MR | Zbl

[7] Taitslin M. A., “A general condition for collapse results”, Annals of Pure and Applied Logic, 113 (2001), 323–330 | DOI | MR

[8] Taitslin M. A., “Translyatsionnye rezultaty v teorii baz dannykh”, Slozhnye sistemy: obrabotka informatsii, modelirovanie i optimizatsiya, Tverskoi gos. un-t, Tver, 2002, 5–23

[9] Taitslin M. A., “Ogranichennye psevdokonechnaya odnorodnost i izolirovannost”, Vestn. Tverskogo gos. un-ta. Ser. “Prikladnaya matematika”, 2:1 (2003), 5–15