Skip to main content
SpringerLink
Log in

Existence and Uniqueness of Structures Computable in Polynomial Time

  • Published:
Algebra and Logic Aims and scope

Presented by Associate Editor S. S. Goncharov

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Cenzer and J. B. Remmel, “Complexity and categoricity,” Inf. Comput., 140, No. 1, 2–25 (1998).

    Article  MathSciNet  MATH  Google Scholar 

  2. D. Cenzer and J. Remmel, “Polynomial-time versus recursive models,” Ann. Pure Appl. Log., 54, No. 1, 17–58 (1991).

    Article  MathSciNet  MATH  Google Scholar 

  3. D. Cenzer and J. Remmel, “Polynomial-time abelian groups,” Ann. Pure Appl. Log., 56, Nos. 1–3, 313–363 (1992).

  4. 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.

  5. 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.

  6. 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.

  7. S. S. Goncharov, “Algorithmic dimension of Abelian groups,” Proc. 17th All-Union Alg. Conf., Part 2, Minsk (1983).

  8. S. T. Fedoryaev, “Recursively inconsistent algorithmic problems on 1-constructivizable relatively complemented distributive lattices,” Algebra and Logic, 34, No. 6, 371–378 (1995).

  9. S. T. Fedoryaev, “Countability of widths of algebraic reducibility structures for models in some classes,” Sib. Adv. Math., 3, No. 2, 81–103 (1993).

    MathSciNet  MATH  Google Scholar 

  10. B. M. Khusainov, “Algorithmic degree of unars,” Algebra and Logic, 27, No. 4, 301–312 (1988).

  11. O. V. Kudinov, “Algebraic dependences and reducibilities of constructivizations in universal domains,” Tr. Inst. Mat. SO RAN, 25, 74–81 (1993).

    MathSciNet  MATH  Google Scholar 

  12. D. V. Lytkina, “Algebraically nonequivalent constructivization for infinite-dimensional vector space,” Algebra and Logic, 29, No. 6, 430–440 (1990).

  13. 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.

  14. V. A. Uspensky and A. L. Semenov, Algorithm Theory: Contributions and Applications, Nauka, Moscow (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia

    P. E. Alaev

  2. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

    P. E. Alaev

Authors
  1. P. E. Alaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. E. Alaev.

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

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-016-9377-6

Search

Navigation