Skip to main content
SpringerLink
Log in

The Diversity of Categoricity Without Delay

  • COMMUNICATIONS
  • Published:
Algebra and Logic Aims and scope

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

References

  1. I. Kalimullin, A. Melnikov, and K. M. Ng, “Algebraic structures computable without delay,” Theor. Comput. Sci., 674, 73-98 (2017).

    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, R. G. Downey, J. B. Remmel, and Z. Uddin, “Space complexity of Abelian groups,” Arch. Math. Log., 48, No. 1, 115-140 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  4. C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Stud. Log. Found. Math., 144, Elsevier, Amsterdam (2000).

  5. S. S. Goncharov and Yu. L. Ershov, Constructive Models, Siberian School of Algebra and Logic [in Russian] Nauch. Kniga, Novosibirsk (1999).

    Google Scholar 

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

    Article  MATH  Google Scholar 

  7. L. Kristiansen, Papers on Subrecursion Theory, Dr. scient.-graden, Research report 217, PhD thesis, Dep. Inform., Univ. Oslo (1996).

  8. C. J. Ash, “Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees,” Trans. Am. Math. Soc., 298, No. 2, 497-514 (1986).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazan (Volga Region) Federal University, ul. Kremlevskaya 18, Kazan, 420008, Russia

    I. S. Kalimullin

  2. Massey University Auckland, Private Bag 102904, North Shore, Auckland, 0745, New Zealand

    A. G. Melnikov

  3. Nanyang Technology University, Nanyang Avenue 50, Singapore, 639798, Singapore

    K. M. Ng

Authors
  1. I. S. Kalimullin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. G. Melnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. M. Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. S. Kalimullin.

Additional information

Translated from Algebra i Logika, Vol. 56, No. 2, pp. 256-266, March-April, 2017.

Supported by RFBR (project No. 15-01-08252) and by the Russian Ministry of Education and Science (grant No. 1.451.2016/1.4) (I. S. Kalimullin).

Supported by grants Marsden Fund of New Zealand and Massey University Research Fund (A. G. Melnikov).

Supported by grants MOE-RG26/13 and MOE2015-T2-2-055 (K. M. Ng).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kalimullin, I.S., Melnikov, A.G. & Ng, K.M. The Diversity of Categoricity Without Delay. Algebra Logic 56, 171–177 (2017). https://doi.org/10.1007/s10469-017-9437-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-017-9437-6

Search

Navigation