Embeddings and extensions of embeddings in the r.e. tt and wtt-degrees
暂无分享，去创建一个
[1] A. Lachlan. Initial Segments of Many-One Degrees , 1970, Canadian Journal of Mathematics.
[2] S. K. Thomason. Sublattices of the Recursively Enumerable Degrees , 1971 .
[3] Alistair H. Lachlan. Initial segments of one-one degrees , 1969 .
[4] Pavel Pudlák,et al. Every finite lattice can be embedded in a finite partition lattice , 1980 .
[5] Alistair H. Lachlan. Embedding nondistributive lattices in the recursively enumerable degrees , 1972 .
[6] Manuel Lerman,et al. Degrees of Unsolvability: Local and Global Theory , 1983 .
[7] Michael Stob. Wtt-Degrees and T-Degrees of R.E. Sets , 1983, J. Symb. Log..
[8] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[9] Richard A. Shore. Finitely generated codings and the degrees r.e. in a degree , 1982 .
[10] Robert I. Soare. Recursion Theory: its Generalisations and Applications: Fundamental Methods for Constructing Recursively Enumerable Degrees , 1980 .
[11] Manuel Lerman,et al. Degrees of Unsolvability: Local and Global Theory , 1983 .
[12] Saharon Shelah,et al. The undecidability of the recursively enumerable degrees , 1982 .
[13] R. Soare. Recursively enumerable sets and degrees , 1987 .
[14] R. Soare,et al. Not every finite lattice is embeddable in the recursively enumerable degrees , 1980 .