Skip to main content
Log in

Some properties of r-maximal sets and Q 1,N -reducibility

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We show that the c.e. \({Q_{1,N}}\)-degrees are not an upper semilattice. We prove that if M is an r-maximal set, A is an arbitrary set and \({M \equiv{}_ {Q_{1,N}}A}\), then \({M\leq{}_{m} A}\). Also, if M 1 and M 2 are r-maximal sets, A and B are major subsets of M 1 and M 2, respectively, and \({M_{1}{\setminus} A\equiv{}_{Q_{1,N}}M_{2}{\setminus} B}\), then \({M_{1}{\setminus}A\equiv{}_{m}M_{2}{\setminus} B}\). If M 1 and M 2 are r-maximal sets and \({M_{1}^{0},\,M_{1}^{1}}\) and \({M_{2}^{0},\,M_{2}^{1}}\) are nontrivial splittings of M 1 and M 2, respectively, then \({M_{1}^{0} \equiv{}_{Q_{1,N}}M_{2}^{0}}\) if and only if \({M_{1}^{0} \equiv{}_{1}M_{2}^{0}}\). From this result follows that if A and B are Friedberg splitting of an r-maximal set, then the \({Q_{1,N}}\)-degree of \({A\,(Q_{1,N}}\)-degree of B) contains only one c.e. 1-degree.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bulitko, V.K.: Ways to characterize complete sets. Izv. Akad. Nauk SSSR Ser. Mat. 55(2), 227–253 (1991) (in Russian)

  2. Bulitko, V.K.: Ways to characterize complete sets. Math. USSR-Izv. 38(2), 225–249 (1992) (English translation)

  3. Cleave J.P.: Some properties of recursively inseparable sets. Z. Math. Logik Grundlagen Math. 16, 187–200 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  4. Degtev, A.N.: Recursively enumerable sets and reducibility of truth-table type. Nauka. Fizmatlit. Moscow, 1998 (in Russian)

  5. Downey R.G., Stob M.: Automorphisms of the lattice of recursively enumerable sets: orbits. Adv. Math. 92(2), 237–265 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Downey R., Stob M.: Splitting theorems in recursion theory. Ann. Pure Appl. Logic 65(1), 1–106 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  7. Jockusch C.G. Jr.: Semirecursive sets and positive reducibility. Trans. Am. Math. Soc. 131, 420–436 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jockusch C.G. Jr.: Relationships between reducibilities. Trans. Am. Math. Soc. 142, 229–237 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kobzev, G.N.: btt-reducibility. Candidate’s Dissertation, Novosibirsk (1975) (in Russian)

  10. Lachlan A.H.: On the lattice of recursively enumerable sets. Trans. Am. Math. Soc. 130, 1–37 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  11. Marchenkov, S.S.: A certain class of incomplete sets. Mat. Zametki 20(4), 473–478 (1976) (in Russian)

  12. Marchenkov, S.S.: A certain class of incomplete sets. Math. Notes 20, 823–825 (1976) (English translation)

  13. Morozov, A.S.: On a class of recursively enumerable sets, Sibirsk. Mat. Zh. 28(2), 124–128 (1987) (in Russian)

  14. Omanadze, R.Sh.: The upper semilattice of recursively enumerable Q-degrees. Algebra i Logika 23(2), 175–184 (1984) (in Russian)

  15. Omanadze, R.Sh.: The upper semilattice of recursively enumerable Q-degrees. Algebra Logic 23, 124–129 (1985) (English translation)

  16. Omanadze, R.Sh.: Q-reducibility and nowhere simple sets, Soobshch. Akad. Nauk Gruzin. SSR 127(1), 29–32 (1987) (in Russian)

  17. Omanadze, R.Sh.: On a strengthening of Q-reducibility. Algebra i Logika 34(1), 79–87 (1995) (in Russian)

  18. Omanadze, R.Sh.: On a strengthening of Q-reducibility. Algebra Logic 34(1), 45–49 (1995) (English translation)

  19. Omanadze R.: On some properties of r-maximal sets and Q 1-N -reducibility. Georgian Math. J. 9(1), 161–166 (2002)

    MathSciNet  MATH  Google Scholar 

  20. Omanadze, R.Sh.: Major sets, classes of simple sets, and Q-complete sets. Mat. Zametki 71(1), 100–108 (2002) (in Russian)

  21. Omanadze, R.Sh.: Major sets, classes of simple sets, and Q-complete sets. Math. Notes 71(1–2), 90–97 (2002) (English translation)

  22. Omanadze R.Sh., Chitaia I.O.: Q 1-degrees of c.e. sets, Arch. Math. Logic 51(5–6), 503–515 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  23. Rogers H. Jr.: Theory of recursive functions and effective computability. McGraw-Hill Book Co., New York (1967)

    MATH  Google Scholar 

  24. Shore R.A.: Nowhere simple sets and the lattice of recursively enumerable sets. J. Symbolic Logic 43(2), 322–330 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  25. Soare R.I.: Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic. Springer, Berlin (1987)

    Book  Google Scholar 

  26. Yates C.E.M.: On the degrees of index sets. II. Trans. Am. Math. Soc. 135(1), 249–266 (1969)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. Sh. Omanadze.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Omanadze, R.S. Some properties of r-maximal sets and Q 1,N -reducibility. Arch. Math. Logic 54, 941–959 (2015). https://doi.org/10.1007/s00153-015-0451-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-015-0451-x

Keywords

Mathematics Subject Classification

Navigation