The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent

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

zbMATH Keywords

elementary equivalencecomputable Lipschitz reducibilitycuppable degreesdegree structuresidentity-bounded Turing reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets