Skip to main content
SpringerLink
Log in

Σ 02 -Initial Segments of Computable Linear Orders

  • 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. R. I. Soare, Recursively Enumerable Sets and Degrees, Persp. Math. Log., Springer, Heidelberg (1987).

    Book  Google Scholar 

  2. M. J. Raw, “Complexity of automorphisms of recursive linear orders,” Ph.D. Thesis, Univ. Wisconsin–Madison (1995).

  3. R. J. Coles, R. Downey, and B. Khoussainov, “On initial segments of computable linear orders,” Order, 14, No. 2, 107-124 (1998).

    Article  MathSciNet  MATH  Google Scholar 

  4. M. V. Zubkov, “Initial segments of computable linear orders with additional computable predicates,” Algebra and Logic, 48, No. 5, 321-329 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  5. K. Ambos-Spies, S. B. Cooper, and S. Lempp, “Initial segments of recursive linear orders,” Order, 14, No. 2, 101-105 (1998).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    R. I. Bikmukhametov

Authors
  1. R. I. Bikmukhametov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. I. Bikmukhametov.

Additional information

*Supported by RFBR, project Nos. 12-01-97008 and 14.01.31158.

Translated from Algebra i Logika, Vol. 53, No. 3, pp. 413-415, May-June, 2014.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bikmukhametov, R.I. Σ 02 -Initial Segments of Computable Linear Orders. Algebra Logic 53, 266–267 (2014). https://doi.org/10.1007/s10469-014-9288-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-014-9288-3

Keywords

Search

Navigation