Decidability of classes of algebraic systems in polynomial time

被引:0
|
作者
Anokhin, MI [1 ]
机构
[1] Moscow MV Lomonosov State Univ, Moscow 117234, Russia
关键词
D O I
10.1070/SM2002v193n02ABEH000625
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For some classes of algebraic systems several kinds of polynomial-time decidability are considered, which use an oracle performing signature operations and computing prodicates. 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.
引用
收藏
页码:157 / 186
页数:30
相关论文
共 50 条