|
Decidability of classes of algebraic systems in polynomial time
M. I. Anokhin M. V. Lomonosov Moscow State University
Abstract:
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.
Received: 13.11.2000
Citation:
M. I. Anokhin, “Decidability of classes of algebraic systems in polynomial time”, Mat. Sb., 193:2 (2002), 3–34; Sb. Math., 193:2 (2002), 157–186
Linking options:
https://www.mathnet.ru/eng/sm625https://doi.org/10.1070/SM2002v193n02ABEH000625 https://www.mathnet.ru/eng/sm/v193/i2/p3
|
Statistics & downloads: |
Abstract page: | 315 | Russian version PDF: | 179 | English version PDF: | 7 | References: | 73 | First page: | 1 |
|