Geodesic
Algorithmic recognizability of finiteness property of finite-definite systems
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 6 (2006) no. 4, pp. 83-92 
E. N. Pavlovsky. Algorithmic recognizability of finiteness property of finite-definite systems. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 6 (2006) no. 4, pp. 83-92. http://geodesic.mathdoc.fr/item/VNGU_2006_6_4_a4/
@article{VNGU_2006_6_4_a4,
     author = {E. N. Pavlovsky},
     title = {Algorithmic recognizability of finiteness property of finite-definite systems},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {83--92},
     year = {2006},
     volume = {6},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2006_6_4_a4/}
}
TY  - JOUR
AU  - E. N. Pavlovsky
TI  - Algorithmic recognizability of finiteness property of finite-definite systems
JO  - Sibirskij žurnal čistoj i prikladnoj matematiki
PY  - 2006
SP  - 83
EP  - 92
VL  - 6
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/VNGU_2006_6_4_a4/
LA  - ru
ID  - VNGU_2006_6_4_a4
ER  - 
%0 Journal Article
%A E. N. Pavlovsky
%T Algorithmic recognizability of finiteness property of finite-definite systems
%J Sibirskij žurnal čistoj i prikladnoj matematiki
%D 2006
%P 83-92
%V 6
%N 4
%U http://geodesic.mathdoc.fr/item/VNGU_2006_6_4_a4/
%G ru
%F VNGU_2006_6_4_a4

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

The object of this work is a property of finiteness of finite-definite systems, specified with a number of quasi-identities. The purpose of this work is to show in what cases algorithm determining finiteness such systems exists. Using algorithmic methods in universal algebra theory, basing on previous results in adjacent regions (S. I. Adyan, M. O. Rabin, on algorithmic properties of finite-definite groups and semigroups) there was a success in following results: in case of signature consist of one unary operation and some constants — there is an unified algorithm determining finiteness of finite-definite systems, in case of several unary operations or one binary operation with at least one constant — there is no unified algorithm. Results of this research are able to be applied in treat of correctness of abstract data type description with quasi-identities.

[1] Adyan S. I., Durnev V. G., “Algoritmicheskie problemy dlya grupp i polugrupp”, Uspekhi mat. nauk, 55:2 (2000), 4–94

[2] Goncharov S. S., “Modeli dannykh i yazyki ikh opisanii”, Vychislitelnye sistemy, no. 107, 52–70

[3] Gorbunov V. A., Algebraicheskaya teoriya kvazimnogoobrazii, Nauchnaya kniga, Novosibirsk, 1999 | Zbl

[4] Ilicheva O. A., “O semantike kvazitozhdestv, opredelyayuschikh modeli konstant”, Vychislitelnye sistemy, no. 116, 16–32

[5] Kasymov N. Kh., Morozov A. S., “Logicheskie aspekty teorii abstraktnykh tipov dannykh”, Vychislitelnye sistemy, no. 122, 73–96

[6] Maltsev A. I., Algebraicheskie sistemy, Nauka, M., 1970, 312–322 | Zbl

[7] Maltsev A. I., Algoritmy i rekursivnye funktsii, Nauka, M., 1986, 254–263

[8] Markov A. A., “Teoriya algorifmov”, Tr. Matem. in-ta im. V. A. Steklova, 42, 1954

[9] Popov V. Yu., “Markovskie svoistva bernsaidovskikh mnogoobrazii grupp”, Algebra i logika, 42:1 (2003), 94–106 | MR | Zbl