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

DOI10.1016/J.APAL.2012.11.002MaRDI QIDQ1944337zbMATH OpenOpenAlexFDO

Authors Philipp Bodewig, Yun Fan, Thorsten Kräling, Klaus Ambos-Spies

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)

Recommendations

• Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees
• The ibT degrees of computably enumerable sets are not dense
• A computably enumerable partial ordering without computably enumerable maximal chains and antichains
• Computably enumerable partial orders
• \(sQ_1\)-degrees of computably enumerable sets
• Computability-theoretic and proof-theoretic aspects of partial and linear orderings
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Embedding countable partial orderings in the enumeration degrees and the \(\omega \)-enumeration degrees
• Hierarchy of Computably Enumerable Degrees II
• Theory and Applications of Models of Computation

Cited in

(4)

• The ibT degrees of computably enumerable sets are not dense
• Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees
• On the strongly bounded Turing degrees of simple sets
• On the strongly bounded Turing degrees of the computably enumerable sets

This page was built for publication: The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944337)