Sciweavers

APAL   1998
Wall of Fame | Most Viewed APAL-1998 Paper
APAL
1998
121views more  APAL 1998»
14 years 10 days ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source121
2Download preprint from source88
3Download preprint from source71
4Download preprint from source71
5Download preprint from source60
6Download preprint from source56
7Download preprint from source54
8Download preprint from source51