Abstract
Let $P(A)$ be the following property, where $A$ is any infinite set of natural numbers: \begin{displaymath} (\forall X)[X\subseteq A\wedge |A-X|=\infty\Rightarrow A\not\le_m X]. \end{displaymath} Let $({\bf R}, \le)$ be the partial ordering of all the r.e. Turing degrees. We propose the study of the order theoretic properties of the substructure $({\bf S}_{m},\le_{{\bf S}_m})$, where ${\bf S}_{m}=_{\rm dfn}\{{\bf a}\in {\bf R}$: ${\bf a}$ contains an infinite set $A$ such that P(A) is true$\}$, and $\le_{{\bf S}_m}$ is the restriction of $\le$ to ${\bf S}_m$. In this paper we start by studying the existence of minimal pairs in ${\bf S}_{m}$.
Highlights
For every infinite set A let us formulate the following property P(A):(∀X)[X ⊆ A ∧ |A − X| = ∞ ⇒ A ≤m X], (1)where ≤m denotes the many-one reducibility
This study could be extended to substructures (Sr, ≤Sr ) for other strong reducibilities ≤r with ≤r ≤T, where Sr = {a ∈ R : a contains an infinite set which has the property (1) with ≤r in place of ≤m}
In this paper we provide a minimal pair in Sm constituted of two low1 Turing degrees
Summary
For every infinite set A let us formulate the following property P(A):. where ≤m denotes the many-one reducibility. In this paper we propose the study of the partially ordered substructure (Sm, ≤Sm ), where ≤Sm denotes the order ≤ restricted to Sm. We know that 0 ∈ Sm (Cintioli, 2005), that Sm contains a low Turing degree (Cintioli, 2011), and that 0 Sm (Cintioli & Silvestri, 2003). This problematic collapses if it is true that Sm = R−{0}: essentially all the order theoretic properties true in (R, ≤) will be inherited by (Sm, ≤Sm ) but at most some exception, due to the fact that 0 Sm. this study could be extended to substructures (Sr, ≤Sr ) for other strong reducibilities ≤r with ≤r ≤T , where Sr = {a ∈ R : a contains an infinite set which has the property (1) with ≤r in place of ≤m}. In this paper we provide a minimal pair in Sm constituted of two low Turing degrees
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.