Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees

DOI10.1016/j.apal.2023.103403arXiv2109.09215OpenAlexW4390598255MaRDI QIDQ6119790

Liling Ko

Publication date: 20 February 2024

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.09215

zbMATH Keywords

latticeembeddingrecursively enumerablehierarchyTuring degreesfickleness

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• Not every finite lattice is embeddable in the recursively enumerable degrees
• A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
• Computable structures and the hyperarithmetical hierarchy
• On Pairs of Recursively Enumerable Degrees
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• A Hierarchy of Turing Degrees
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Sublattices of the Recursively Enumerable Degrees

This page was built for publication: Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees