Skip to main content
SpringerLink
Log in

Structures Computable in Polynomial Time. I

  • Published:
Algebra and Logic Aims and scope

It is proved that every computable locally finite structure with finitely many functions has a presentation computable in polynomial time. Furthermore, a structure computable in polynomial time is polynomially categorical iff it is finite. If a structure is computable in polynomial time and locally finite then it is weakly polynomially categorical (i.e., categorical with respect to primitive recursive isomorphisms) iff it is finite.

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 theoretic model theory and algebra,” in Handbook of Recursive Mathematics, Vol. 1, Recursive Model Theory, Y. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel (eds.), Stud. Log. Found. Math., 138, Elsevier, Amsterdam (1998), pp. 381-513.

  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. S. Grigorieff, “Every recursive linear ordering has a copy in DTIME-SPACE (n, log(n)),” J. Symb. Log., 55, No. 1, 260-276 (1990).

    Article  MathSciNet  MATH  Google Scholar 

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

  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. I. Kalimullin, A. Melnikov, and K. M. Ng, “Algebraic structures computable without delay,” accepted in Theor. Comput. Sci.

  8. P. E. Alaev, “Existence and uniqueness of structures computable in polynomial time,” Algebra and Logic, 55, No. 1, 72-76 (2016).

  9. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, London (1975).

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  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. 6, pp. 647-669, November-December, 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. Structures Computable in Polynomial Time. I. Algebra Logic 55, 421–435 (2017). https://doi.org/10.1007/s10469-017-9416-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-017-9416-y

Keywords

Search

Navigation