Lattice embeddings into the recursively enumerable degrees
暂无分享,去创建一个
[1] R. Soare,et al. Not every finite lattice is embeddable in the recursively enumerable degrees , 1980 .
[2] Robert I. Soare,et al. The elementary theory of the recursively enumerable degrees is not N0-categorical , 1984 .
[3] David B. Posner,et al. Diagonalization in Degree Constructions , 1978, J. Symb. Log..
[4] Manuel Lerman,et al. Degrees of Unsolvability: Local and Global Theory , 1983 .
[5] R. Friedberg,et al. TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944). , 1957, Proceedings of the National Academy of Sciences of the United States of America.
[6] Manuel Lerman. Admissible ordinals and priority arguments , 1973 .
[7] Alistair H. Lachlan. Embedding nondistributive lattices in the recursively enumerable degrees , 1972 .
[8] Alistair H. Lachlan,et al. Lower Bounds for Pairs of Recursively Enumerable Degrees , 1966 .
[9] S. K. Thomason. Sublattices of the Recursively Enumerable Degrees , 1971 .
[10] Saharon Shelah,et al. The undecidability of the recursively enumerable degrees , 1982 .