Mathematical Logic Quarterly 40 (1):106-110 (1994)

Abstract
The project was partially supported by a NSF grant of China. The author was grateful to Professor S. Lempp for his encouragement and suggestion while the author was visiting the Department of Mathematics at the University of Wisconsin
Keywords wtt‐reducibility  Turing reducibility  Recursively enumerable set
Categories No categories specified
(categorize this paper)
DOI 10.1002/malq.19940400115
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 62,242
Through your library

References found in this work BETA

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2013-11-03

Total views
10 ( #869,397 of 2,444,848 )

Recent downloads (6 months)
1 ( #457,287 of 2,444,848 )

How can I increase my downloads?

Downloads

My notes