Related papers: Extending Properly n-REA Sets

"How much c.e. sets could cover a given set?" in this paper we are going to answer this question. Also, in this approach some old concepts come into a new arrangement. The major goal of this article is to introduce an appropriate definition…

We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table…

Let $R$ be an indecomposable root system. It is well known that any root is part of a basis $B$ of $R$. But when can you extend a set of two or more roots to a basis $B$ of $R$? A $\pi$-system is a linearly independent set of roots, $C$,…

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

Harrington and Soare introduced the notion of an n-tardy set. They showed that there is a nonempty $\mathcal{E}$ property Q(A) such that if Q(A) then A is 2-tardy. Since they also showed no 2-tardy set is complete, Harrington and Soare…

We investigate what collections of c.e.\ Turing degrees can be realised as the collection of elements of a separating $\Pi^0_1$ class of c.e.\ degree. We show that for every c.e.\ degree $\mathbf{c}$, the collection $\{\mathbf{c},…

This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

In the study of the arithmetic degrees (the degree structure induced by relative arithmetic definability, ($\leq_{a}$) the $\omega$-REA sets play a role analogous to the role the r.e. degrees play in the study of the Turing degrees.…

We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…

In this paper we show that for every $2\leq n\in \mathbb{N}$, the statement "there is an $n$-entangled set, but there are no $n+1$-entangled sets" is consistent. We also prove some theorems which improve our understanding of entangled sets…

Let $h \geq 2$, $k \geq 5$ be integers and $A$ be a nonempty finite set of $k$ integers. Very recently, Tang and Xing studied extended inverse theorems for $hk-h+1 < \left|hA\right| \leq hk+2h-3$. In this paper, we extend the work of Tang…

It is easy to see that no n-REA set can form a (non-trivial) minimal pair with 0' and only slightly more difficult to observe that no {\omega}-REA set can form a (non-trivial) minimal pair with 0". Shore has asked whether this can be…

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

Green and Sisask showed that the maximal number of $3$-term arithmetic progressions in $n$-element sets of integers is $\lceil n^2/2\rceil$; it is easy to see that the same holds if the set of integers is replaced by the real line or by any…

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…

We give infinite triangularization and strict triangularization results for algebras of operators on infinite dimensional vector spaces. We introduce a class of algebras we call Ore-solvable algebras: these are similar to iterated Ore…