Geodesic
Finite quantifier hierarchies in relational algebras
Informatics and Automation, Algorithmic aspects of algebra and logic, Tome 274 (2011), pp. 291-296.

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

For a given structure of finite signature, one can construct a hierarchy of classes of relations definable in this structure according to the number of quantifier alternations in the formulas expressing the relations. In ordinary examples, this hierarchy is either infinite (as in the arithmetic of addition and multiplication of natural numbers) or stabilizes very rapidly (in structures with decidable theories, such as the field of real numbers). In the present paper, we construct a series of examples showing that the above-mentioned hierarchy may have an arbitrary finite length. The proof employs a modification of the Ehrenfeucht game. 
@article{TRSPY_2011_274_a15,
     author = {A. L. Semenov and S. F. Soprunov},
     title = {Finite quantifier hierarchies in relational algebras},
     journal = {Informatics and Automation},
     pages = {291--296},
     publisher = {mathdoc},
     volume = {274},
     year = {2011},
     language = {ru},
     url = {https://geodesic-test.mathdoc.fr/item/TRSPY_2011_274_a15/}
}
TY  - JOUR
AU  - A. L. Semenov
AU  - S. F. Soprunov
TI  - Finite quantifier hierarchies in relational algebras
JO  - Informatics and Automation
PY  - 2011
SP  - 291
EP  - 296
VL  - 274
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/TRSPY_2011_274_a15/
LA  - ru
ID  - TRSPY_2011_274_a15
ER  - 
%0 Journal Article
%A A. L. Semenov
%A S. F. Soprunov
%T Finite quantifier hierarchies in relational algebras
%J Informatics and Automation
%D 2011
%P 291-296
%V 274
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/TRSPY_2011_274_a15/
%G ru
%F TRSPY_2011_274_a15
A. L. Semenov; S. F. Soprunov. Finite quantifier hierarchies in relational algebras. Informatics and Automation, Algorithmic aspects of algebra and logic, Tome 274 (2011), pp. 291-296. https://geodesic-test.mathdoc.fr/item/TRSPY_2011_274_a15/

[1] Semenov A.L., “Usloviya konechnosti dlya algebr otnoshenii”, Tr. MIAN, 242, 2003, 103–107 | Zbl

[2] Vereschagin N.K., Shen A., Yazyki i ischisleniya, MTsNMO, M., 2000