Home Nonbounding 𝑛-C.E. 𝑄-Degrees
Article
Licensed
Unlicensed Requires Authentication

Nonbounding 𝑛-C.E. 𝑄-Degrees

  • Roland Omanadze
Published/Copyright: March 11, 2010
Become an author with De Gruyter Brill
Georgian Mathematical Journal
From the journal Volume 16 Issue 4

Abstract

We prove that for any noncomputable c.e. set 𝐴 there is a non-computable c.e. set 𝐡 βŠ† 𝐴 such that for every noncomputable c.e. set π‘Š we have π‘Š β‰°βƒ₯ 𝑄𝐴 – 𝐡 < 𝑄𝐴. We show that if c.e. 𝑄-degrees 𝐚 and 𝐛 form a minimal pair in the c.e. 𝑄-degrees, then 𝐚 and 𝐛 form a minimal pair in the 𝑄-degrees.

Received: 2008-11-24
Revised: 2009-08-12
Published Online: 2010-03-11
Published in Print: 2009-December

Β© Heldermann Verlag

Downloaded on 25.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/GMJ.2009.779/pdf
Scroll to top button