Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. D.A. Martin, The priority method of Sacks, mimeographed.
2. R.M. Friedberg, Two recursively enumerable sets of incomparable degrees of unsolvability, Proc. Nat. Acad. Sci. U.S.A. 43 (1957), 236–238.
3. A.H. Lachlan, Lower bounds for pairs of recursively enumerable degrees, Proc. London Math. Soc. (3) 16 (1966), 537–569.
4. _____, The priority method I, Zeitschr. f. math. Logik und Grundlagen Math. 13 (1967), 1–10.
5. A.A. Mučnik, Negative answer to the problem of reducibility of the theory of algorithms (Russian), Dokl. Akad. Nank SSSR 108 (1956), 194–197.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. PRIORITY ARGUMENTS VIA TRUE STAGES;The Journal of Symbolic Logic;2014-12
2. Formalism and intuition in computability;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2012-07-28
3. Iterated trees and fragments of arithmetic;Archive for Mathematical Logic;1995-03
4. TOPOLOGICAL FRAMEWORK FOR FINITE INJURY;Zeitschrift für Mathematische Logik und Grundlagen der Mathematik;1992
5. Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989;Journal of Symbolic Logic;1990-03