Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

APAL
1998

favoriteEmaildiscussreport

121views more APAL 1998»

Computably Enumerable Sets and Quasi-Reducibility

13 years 11 months ago

Computably Enumerable Sets and Quasi-Reducibility

Download homepages.mcs.vuw.ac.nz

We consider the computably enumerable sets under the relation of Qreducibility. We ﬁrst give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under this reducibility with the more familiar structure of the c.e. Turing degrees. In our ﬁnal section, we use coding methods to show that the elementary theory of RQ, ≤Q is undecidable.

Rodney G. Downey, Geoffrey LaForte, André N

Real-time Traffic

APAL 1998 | Enumerable Sets | Familiar Structure | Upper Semilattice |

claim paper

Related Content

» The ibT degrees of computably enumerable sets are not dense

» The computable Lipschitz degrees of computably enumerable sets are not dense

» Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees

» The Complexity of Orbits of Computably Enumerable Sets

» Definable encodings in the computably enumerable sets

» Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredun...

» Presentations of computably enumerable reals

» Support Weight Enumerators and Coset Weight Distributions of Isodual Codes

» Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments

Post Info
More Details (n/a)

Added	21 Dec 2010
Updated	21 Dec 2010
Type	Journal
Year	1998
Where	APAL
Authors	Rodney G. Downey, Geoffrey LaForte, André Nies

Comments (0)