|
Embedding of Countable Orders in Turing Degrees
Sh. T. Ishmukhametov Ulyanovsk State University
Abstract:
In their classical papers, Lerman, Lachlan, and Lebeuf developed the embedding method, which provides constructions of initial segments of Turing degrees isomorphic to various partially ordered structures. We analyze this method and prove that there is a nonzero degree below each decreasing chain of degrees uniform in $\mathbf 0'$. This imposes restrictions on the application of the embedding method.
Received: 18.09.1999 Revised: 13.04.2001
Citation:
Sh. T. Ishmukhametov, “Embedding of Countable Orders in Turing Degrees”, Mat. Zametki, 72:5 (2002), 682–687; Math. Notes, 72:5 (2002), 631–635
Linking options:
https://www.mathnet.ru/eng/mzm456https://doi.org/10.4213/mzm456 https://www.mathnet.ru/eng/mzm/v72/i5/p682
|
Statistics & downloads: |
Abstract page: | 270 | Full-text PDF : | 153 | References: | 48 | First page: | 1 |
|