JUCS - Journal of Universal Computer Science 3(3): 172-184, doi: 10.3217/jucs-003-03-0172
Difference Splittings of Recursively Enumerable Sets
expand article infoAsat Arslanov‡
‡ Computer Science Department, The University of Auckland, New Zealand

Corresponding author: Asat Arslanov ( aars01@cs.auckland.ac.nz )

© Asat Arslanov.
This article is freely available under the J.UCS Open Content License.
Citation: Arslanov A (1997) Difference Splittings of Recursively Enumerable Sets. JUCS - Journal of Universal Computer Science 3(3): 172-184. https://doi.org/10.3217/jucs-003-03-0172
Open Access
Abstract
We study here the degree-theoretic structure of set-theoretical splittings of recursively enumerable (r.e.) sets into differences of r.e. sets. As a corollary we deduce that the odering of wtt-degrees of unsolvability of differences of r.e. sets is not a distributive semilattice and is not elementarily equivalent to the ordering of r.e. wtt-degrees of unsolvability.