Skip to main content
SpringerLink
Log in

Effective Categoricity of Computable Linear Orderings

  • 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. S. S. Goncharov, “Autostability and computable families of constructivizations,” Algebra and Logic, 14, No. 6, 392-409 (1975).

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. J. B. Remmel, “Recursively categorical linear orderings,” Proc. Am. Math. Soc., 83, No. 2, 387-391 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  4. C. McCoy, “Δ 02 -categoricity in Boolean algebras and linear orderings,” Ann. Pure Appl. Log., 119, Nos. 1-3, 85-120 (2003).

  5. A. N. Frolov, “Δ 2 n -categorical linear ordering,” Bull. Symb. Log., 14, No. 1, 140 (2008).

  6. R. G. Downey and J. F. Knight, “Orderings with αth jump degree 0(α),” Proc. Am. Math. Soc., 114, No. 2, 545-552 (1992).

    MathSciNet  MATH  Google Scholar 

  7. A. N. Frolov, “ Δ 02 -copies of linear orderings,” Algebra and Logic, 45, No. 3, 201-209 (2006).

  8. A. N. Frolov, “Linear orderings. Coding theorems,” Uch. Zap. Kazan Gos. Univ., Ser. Fiz.-Mat. N., 154, No. 2, 142-151 (2012).

  9. E. B. Fokina, I. Kalimullin, and R. Miller, “Degrees of categoricity of computable structures,” Arch. Math. Log., 49, No. 1, 51-67 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  10. A. N. Frolov, “Presentations of the successor relation of computably linear ordering,” Izv. Vyssh. Uch. Zav., Ser. Mat., No. 7, 73-85 (2010).

Download references

Author information

Authors and Affiliations

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

    A. N. Frolov

Authors
  1. A. N. Frolov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. N. Frolov.

Additional information

Presented by the Program Committee of the Conference “Mal’tsev Readings”

Translated from Algebra i Logika, Vol. 54, No. 5, pp. 638-642, September-October, 2015.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Frolov, A.N. Effective Categoricity of Computable Linear Orderings. Algebra Logic 54, 415–417 (2015). https://doi.org/10.1007/s10469-015-9362-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-015-9362-5

Keywords

Search

Navigation