On the Universal Splitting Property

Mathematical Logic Quarterly 43 (3):311-320 (1997)
  Copy   BIBTEX

Abstract

We prove that if an incomplete computably enumerable set has the the universal splitting property then it is low2. This solves a question from Ambos-Spies and Fejer [1] and Downey and Stob [7]. Some technical improvements are discussed

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The universal splitting property. II.M. Lerman & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (1):137-150.
Definable incompleteness and Friedberg splittings.Russell Miller - 2002 - Journal of Symbolic Logic 67 (2):679-696.
A Splitting with Infimum in the d-c. e. Degrees.Q. Lei, L. Hong & D. Decheng - 2000 - Mathematical Logic Quarterly 46 (1):53-76.
Splitting theorems and the jump operator.R. G. Downey & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 94 (1-3):45-52.
Classes bounded by incomplete sets.Kejia Ho & Frank Stephan - 2002 - Annals of Pure and Applied Logic 116 (1-3):273-295.
There is No Low Maximal D.C.E. Degree.Marat Arslanov, S. Barry Cooper & Angsheng Li - 2000 - Mathematical Logic Quarterly 46 (3):409-416.
Friedberg splittings in Σ3 0 quotient lattices of.Todd Hammond - 1999 - Journal of Symbolic Logic 64 (4):1403-1406.

Analytics

Added to PP
2013-12-01

Downloads
35 (#678,037)

6 months
4 (#864,415)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
The universal splitting property. II.M. Lerman & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (1):137-150.
The weak truth table degrees of recursively enumerable sets.R. E. Ladner - 1975 - Annals of Mathematical Logic 8 (4):429.

View all 8 references / Add more references