Definable encodings in the computably enumerable sets

Bulletin of Symbolic Logic 6 (2):185-196 (2000)
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/421206
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,220
Through your library
References found in this work BETA
Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 12 (1):295-310.
There is No Fat Orbit.Rod Downey & Leo Harrington - 1996 - Annals of Pure and Applied Logic 80 (3):277-289.

Add more references

Citations of this work BETA
Extending and Interpreting Post's Programme.S. Barry Cooper - 2010 - Annals of Pure and Applied Logic 161 (6):775-788.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

24 ( #209,636 of 2,164,581 )

Recent downloads (6 months)

1 ( #347,948 of 2,164,581 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums