Geodesic
Decidability of classes of algebraic systems in polynomial time
Sbornik. Mathematics, Tome 193 (2002) no. 2, pp. 157-186

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

For some classes of algebraic systems several kinds of polynomial-time decidability are considered, which use an oracle performing signature operations and computing predicates. Relationships between various kinds of decidability are studied. Several results on decidability and undecidability in polynomial time are proved for some finitely based varieties of universal algebras. 
@article{SM_2002_193_2_a0,
     author = {M. I. Anokhin},
     title = {Decidability of classes of algebraic systems in polynomial time},
     journal = {Sbornik. Mathematics},
     pages = {157--186},
     publisher = {mathdoc},
     volume = {193},
     number = {2},
     year = {2002},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SM_2002_193_2_a0/}
}
TY  - JOUR
AU  - M. I. Anokhin
TI  - Decidability of classes of algebraic systems in polynomial time
JO  - Sbornik. Mathematics
PY  - 2002
SP  - 157
EP  - 186
VL  - 193
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SM_2002_193_2_a0/
LA  - en
ID  - SM_2002_193_2_a0
ER  - 
%0 Journal Article
%A M. I. Anokhin
%T Decidability of classes of algebraic systems in polynomial time
%J Sbornik. Mathematics
%D 2002
%P 157-186
%V 193
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SM_2002_193_2_a0/
%G en
%F SM_2002_193_2_a0
M. I. Anokhin. Decidability of classes of algebraic systems in polynomial time. Sbornik. Mathematics, Tome 193 (2002) no. 2, pp. 157-186. http://geodesic.mathdoc.fr/item/SM_2002_193_2_a0/