Classifications of degree classes associated with r.e. subspaces

&
Annals of Pure and Applied Logic 42 (2):105-124 (1989)
  Copy   BIBTEX

Abstract

In this article we show that it is possible to completely classify the degrees of r.e. bases of r.e. vector spaces in terms of weak truth table degrees. The ideas extend to classify the degrees of complements and splittings. Several ramifications of the classification are discussed, together with an analysis of the structure of the degrees of pairs of r.e. summands of r.e. spaces

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(89)90051-1

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

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

Infima in the d.r.e. degrees.D. Kaddah - 1993 - Annals of Pure and Applied Logic 62 (3):207-263.
Infima in the Recursively Enumerable Weak Truth Table Degrees.Rich Blaylock, Rod Downey & Steffen Lempp - 1997 - Notre Dame Journal of Formal Logic 38 (3):406-418.
On speedable and levelable vector spaces.Frank A. Bäuerle & Jeffrey B. Remmel - 1994 - Annals of Pure and Applied Logic 67 (1-3):61-112.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
Weak Density and Nondensity among Transfinite Levels of the Ershov Hierarchy.Yong Liu & Cheng Peng - 2020 - Notre Dame Journal of Formal Logic 61 (4):521-536.
Intervals and sublattices of the R.E. weak truth table degrees, part I: Density.R. G. Downey - 1989 - Annals of Pure and Applied Logic 41 (1):1-26.
Intervals and sublattices of the r.e. weak truth table degrees, part II: Nonbounding.R. G. Downey - 1989 - Annals of Pure and Applied Logic 44 (3):153-172.
The d.r.e. degrees are not dense.S. Cooper, Leo Harrington, Alistair Lachlan, Steffen Lempp & Robert Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.
The d.r.e. degrees are not dense.S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp & Robert I. Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.

Analytics

Added to PP
2014-01-16

Downloads
56 (#293,398)

6 months
8 (#415,703)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
On speedable and levelable vector spaces.Frank A. Bäuerle & Jeffrey B. Remmel - 1994 - Annals of Pure and Applied Logic 67 (1-3):61-112.

View all 8 citations / Add more citations

References found in this work

A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
Bounding minimal pairs.A. H. Lachlan - 1979 - Journal of Symbolic Logic 44 (4):626-642.
A survey of lattices of re substructures.Anil Nerode & Jeffrey Remmel - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 42--323.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.

View all 28 references / Add more references