Rank, join, and Cantor singletons

Archive for Mathematical Logic

Volumn 36, Issue 4-5, 1997, Pages 313-320

  Owings, Jim ^a  

^a Bldg 142   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031285147     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530050068     Document Type: Article

References (8)

1. 1 classes. Ann. Pure Appl. Logic 59, 79-139 (1993)
2. 1 set. J. Symb. Logic 54, 975-991 (1989)
3. Cholak, P., Downey, R.: On the Cantor-Bendixson rank of recursively enumerable sets. J. Symb. Logic 58, 629-640 (1993)
4. Downey, R., Yue, Y.: A rank one cohesive set. Ann. Pure Appl. Logic 68, 161-171 (1994)
5. Kummer, M., Stephan, F.: Recursion theoretic properties of frequency computation and bounded queries. Inform. Comput. 120, 59-77 (1995)
6. Martin, G.: Cantor singletons, rank-faithful trees, and other topics in recursion theory. Ph.D. Dissertation, University of Maryland (1993)
7. Owings, J.: A cardinality version of Beigel's nonspeedup theorem. J. Symb. Logic 54, 761-767 (1989)
8. Soare, R.: Recursively enumerable sets and degrees. Berlin Heidelberg New York: Springer 1987