Splitting into degrees with low computational strength

&
Annals of Pure and Applied Logic 169 (8):803-834 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2018.04.004

Other Versions

No versions found

Links

PhilArchive

External links

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

Through your library

My notes

Similar books and articles

A non-splitting theorem in the enumeration degrees.Mariya Ivanova Soskova - 2009 - Annals of Pure and Applied Logic 160 (3):400-418.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Schnorr trivial reals: a construction. [REVIEW]Johanna N. Y. Franklin - 2008 - Archive for Mathematical Logic 46 (7-8):665-678.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
Splitting properties of R. E. sets and degrees.R. G. Downey & L. V. Welch - 1986 - Journal of Symbolic Logic 51 (1):88-109.
A high c.e. degree which is not the join of two minimal degrees.Matthew B. Giorgi - 2010 - Journal of Symbolic Logic 75 (4):1339-1358.
Friedberg splittings of recursively enumerable sets.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 59 (3):175-199.
Ray-Splitting Billiards.R. Blümel, P. M. Koch & L. Sirko - 2001 - Foundations of Physics 31 (2):269-281.
Analytic countably splitting families.Otmar Spinas - 2004 - Journal of Symbolic Logic 69 (1):101-117.

Analytics

Added to PP
2018-04-20

Downloads
64 (#938,406)

6 months
12 (#971,834)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A classification of low c.e. sets and the Ershov hierarchy.Marat Faizrahmanov - 2023 - Mathematical Logic Quarterly 69 (4):508-518.

Add more citations

References found in this work

Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
On very high degrees.Keng Meng Ng - 2008 - Journal of Symbolic Logic 73 (1):309-342.

Add more references