Presented by Associate Editor S. S. Goncharov
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Cenzer and J. B. Remmel, “Complexity and categoricity,” Inf. Comput., 140, No. 1, 2–25 (1998).
D. Cenzer and J. Remmel, “Polynomial-time versus recursive models,” Ann. Pure Appl. Log., 54, No. 1, 17–58 (1991).
D. Cenzer and J. Remmel, “Polynomial-time abelian groups,” Ann. Pure Appl. Log., 56, Nos. 1–3, 313–363 (1992).
D. Cenzer and J. B. Remmel, “Complexity theoretic model theory and algebra,” in Handbook of Recursive Mathematics, Vol. 1, Recursive Model Theory, Stud. Logic Found. Math., 138, Yu. L. Ershov et al. (eds.), Elsevier, Amsterdam (1998), pp. 381–513.
E. I. Latkin, “Polynomial non-autostability. Algebraic approach,” in Logical Methods in Programming, Vychislitel’nye Systemy, 133, Sobolev Institute of Mathematics, Novosibirsk (1990), pp. 14–37.
E. I. Latkin, “An abstract functional that bounds the algorithmic complexity for linear, polynomial, and other similar classes,” in Vychislitel’nye Systemy, 165, Sobolev Institute of Mathematics, Novosibirsk (1999), pp. 84–111.
S. S. Goncharov, “Algorithmic dimension of Abelian groups,” Proc. 17th All-Union Alg. Conf., Part 2, Minsk (1983).
S. T. Fedoryaev, “Recursively inconsistent algorithmic problems on 1-constructivizable relatively complemented distributive lattices,” Algebra and Logic, 34, No. 6, 371–378 (1995).
S. T. Fedoryaev, “Countability of widths of algebraic reducibility structures for models in some classes,” Sib. Adv. Math., 3, No. 2, 81–103 (1993).
B. M. Khusainov, “Algorithmic degree of unars,” Algebra and Logic, 27, No. 4, 301–312 (1988).
O. V. Kudinov, “Algebraic dependences and reducibilities of constructivizations in universal domains,” Tr. Inst. Mat. SO RAN, 25, 74–81 (1993).
D. V. Lytkina, “Algebraically nonequivalent constructivization for infinite-dimensional vector space,” Algebra and Logic, 29, No. 6, 430–440 (1990).
V. A. Uspensky and A. L. Semenov, “Algorithm theory: Contributions and applications,” in Algorithms in Modern Mathematics and Its Applications [in Russian], Part 1, Computer Center SO AN SSSR, Novosibirsk (1982), pp. 99–342.
V. A. Uspensky and A. L. Semenov, Algorithm Theory: Contributions and Applications, Nauka, Moscow (1987).
Author information
Authors and Affiliations
Corresponding author
Additional information
(P. E. Alaev) Supported by RFBR, project No. 14-01-00376.
Translated from Algebra i Logika, Vol. 55, No. 1, pp. 106–112, January-February, 2016.
Rights and permissions
About this article
Cite this article
Alaev, P.E. Existence and Uniqueness of Structures Computable in Polynomial Time. Algebra Logic 55, 72–76 (2016). https://doi.org/10.1007/s10469-016-9377-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-016-9377-6