The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent
From MaRDI portal
Publication:1944337
DOI10.1016/j.apal.2012.11.002zbMath1275.03132OpenAlexW1984904260MaRDI QIDQ1944337
Philipp Bodewig, Yun Fan, Thorsten Kräling, Ambos-Spies, Klaus
Publication date: 5 April 2013
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2012.11.002
elementary equivalencecomputable Lipschitz reducibilitycuppable degreesdegree structuresidentity-bounded Turing reducibility
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items