Skip to main content
SpringerLink
Log in

Primitively Recursively Categorical Linear Orderings

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

We prove that linear orderings are primitively recursively categorical over a class of structures KΣ if and only if they contain only finitely many successivities.

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. Ershov Yu. L. and Goncharov S. S., Constructive Models, Ser. Siberian School of Algebra and Logic, Kluwer Academic/Plenum Publishers, New York, etc. (2000).

    Google Scholar 

  2. Rogers H., Theory of Recursive Functions and Effective Computability, McGraw–Hill, New York (1967).

    MATH  Google Scholar 

  3. Latkin E. I., “Polynomial nonautostability. An algebraic approach,” Logical Methods in Programming, vol. 133, No. 6, 14–37 (1990).

    MathSciNet  MATH  Google Scholar 

  4. Alaev P. E., “Structures computable in polynomial time. I,” Algebra and Logic, vol. 55, No. 6, 421–435 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  5. Alaev P. E., “Categoricity for primitive recursive and polynomial Boolean algebras,” Algebra and Logic, vol. 57, No. 4, 251–274 (2018).

    Article  MathSciNet  MATH  Google Scholar 

  6. Remmel J. B., “Recursively categorical linear orderings,” Proc. Amer. Math. Soc., vol. 83, No. 2, 379–386 (1981).

    MathSciNet  MATH  Google Scholar 

  7. Goncharov S. S. and Dzgoev V. D., “Autostability of models,” Algebra and Logic, vol. 19, No. 1, 28–37 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  8. Cenzer D. and Remmel J. B., “Complexity theoretic model theory and algebra,” in: Handbook of Recursive Mathematics, 1998, vol. 1, 351–355.

    MATH  Google Scholar 

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

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, Novosibirsk, Russia

    K. V. Blinov

Authors
  1. K. V. Blinov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. V. Blinov.

Additional information

The author was supported by the Russian Foundation for Basic Research (Grant 17-01-00247).

__________

Translated from Sibirskii Matematicheskii Zhurnal, vol. 60, no. 1, pp. 28–36, January–February, 2019; DOI: 10.17377/smzh.2019.60.103.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Blinov, K.V. Primitively Recursively Categorical Linear Orderings. Sib Math J 60, 20–26 (2019). https://doi.org/10.1134/S0037446619010038

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0037446619010038

Keywords

Search

Navigation