Author:
Nies André,Shore Richard A
Reference19 articles.
1. K. Ambos-Spies, Minimal pairs for polynomial reducibilities, in: E. Börger, ed., Computation Theory and Logic, Lecture Notes in Computer Science 270 (Springer, Berlin).
2. The theory of the r.e.weak truth-table degrees is undecidable;Ambos-Spies;J. Symbolic Logic,1992
3. Undecidability and 1-types in the r.e. degrees;Ambos-Spies;Ann. Pure Appl. Logic,1993
4. Infima of recursively enumerable truth table degrees.
5. L. Harrington, On the theory of E, to appear.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献