A semilattice generated by superlow computably enumerable degrees

DOI10.3103/S1066369X11010087zbMath1225.03053OpenAlexW2067197646MaRDI QIDQ646847

M. Kh. Faizrakhmanov

Publication date: 18 November 2011

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x11010087

zbMATH Keywords

low degreescritical triplessuperlow degreestotally c. e. degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

A classification of low c.e. sets and the Ershov hierarchy

Cites Work

• Dynamic notions of genericity and array noncomputability
• Strong jump-traceability. I: The computably enumerable case
• Lowness properties and randomness
• On the degrees less than 0'
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Δ 2 0 -Mengen

This page was built for publication: A semilattice generated by superlow computably enumerable degrees