Publisher
Springer Science and Business Media LLC
Reference5 articles.
1. H. Rogers Jr., Theory of Recursive Functions and Effective Computability, McGraw Hill, New York (1967).
2. C. G. Jockusch, ?Relationships between reducibilities,? Trans. Am. Math. Soc.,142, 229?237 (1969).
3. G. N. Kobzev, ?On complete btt-degree,? Algebra Logika,13, No. 1, 22?25 (1974).
4. A. N. Degtev, ?On tt- and m-degrees,? Algebra Logika,12, No. 2, 143?161 (1973).
5. A. H. Lachlan, ?tt- complete sets are not necessarily tt-complete,? Proc. Am. Math. Soc.,48 No. 2 429?434 (1975).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the connections between $wtt$- and $Q$-reducibilities;Journal of Logic and Computation;2018-12-21
2. Classes bounded by incomplete sets;Annals of Pure and Applied Logic;2002-08
3. On the structures inside truth-table degrees;Journal of Symbolic Logic;2001-06
4. Strong reducibilities;Bulletin of the American Mathematical Society;1981