SpringerLink
Log in

Codings on linear orders and algorithmic independence of natural relations

  • Published:
Lobachevskii Journal of Mathematics Aims and scope Submit manuscript

Abstract

We study an algorithmic dependence of natural relations on linear orders relative to the class of their computable presentations. We give complete description of possible combinations of natural relations for which there is a computable linear order such that in any of its computable presentation a given combination of relations is not computable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Germany)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. I. Soare, Recursively Enumerable Sets and Degrees (Springer-Verlag, Berlin, 1987).

    Book  Google Scholar 

  2. J. G. Rosenstein, Linear Orderings (Acad. Press, New York, 1982).

    MATH  Google Scholar 

  3. R. I. Bikmukhametov, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki 155(3), 80 (2013).

    Google Scholar 

  4. M. Moses, Ann. Pure Appl. Logic 27, 253 (1984).

    Article  MATH  MathSciNet  Google Scholar 

  5. J. B. Remmel, Proc. Am. Math. Soc. 83, 387 (1981).

    Article  MATH  MathSciNet  Google Scholar 

  6. R. G. Downey, S. Lempp, and G. Wu, Journal of Mathematical Logic 10(1–2), 83 (2010).

    Article  MATH  MathSciNet  Google Scholar 

  7. A. N. Frolov, Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, No. 7, 73 (2010).

    Google Scholar 

  8. P. E. Alaev, J. J. Thurber, and A. N. Frolov, Algebra i Logika 48(5), 549 (2009).

    Article  MathSciNet  Google Scholar 

  9. J. J. Thurber, Proc. Am. Math. Soc. 123(12), 3859 (1995).

    MATH  MathSciNet  Google Scholar 

  10. A. N. Frolov, Journal of Logic and Computation 22(4), 745 (2010).

    Article  Google Scholar 

  11. M. V. Zubkov, Algebra and Logic 48(5), 564 (2009).

    Article  MathSciNet  Google Scholar 

  12. R. G. Downey, in Handbook of Recursive Mathematics (Elsevier, Amsterdam, 1998), Vol. 2, pp. 823–976.

    Google Scholar 

  13. A. N. Frolov, Algebra and Logic 45(3), 354 (2006).

    Article  MATH  MathSciNet  Google Scholar 

  14. A. N. Frolov, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki 154(2), 142 (2012).

    Google Scholar 

  15. M. Moses, PhD Thesis (Monash Univ., Clayton, Australia, 1983).

  16. R. Watnick, Journal of Symbolic Logic 49, 563 (1984).

    Article  MATH  MathSciNet  Google Scholar 

  17. M. J. S. Raw, PhD Thesis (University of Wisconsin-Madison, Madison, 1995).

Download references

Author information

Authors and Affiliations

  1. N.I. Lobachevskii Institute of Mathematics and Mechanics, Kazan (Volga Region) Federal University, Kremlevskaya ul. 18, Kazan, 420008, Tatarstan, 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

Submitted by M. M. Arslanov

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bikmukhametov, R.I. Codings on linear orders and algorithmic independence of natural relations. Lobachevskii J Math 35, 327–332 (2014). https://doi.org/10.1134/S1995080214040131

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords and phrases

Search

Navigation