A semilattice generated by superlow computably enumerable degrees

DOI10.3103/S1066369X11010087MaRDI QIDQ646847zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A join theorem for the computably enumerable degrees
• scientific article; zbMATH DE number 1752644
• The Rogers semilattices of generalized computable enumerations
• Upper semilattice of recursively enumerable Q-degrees
• On distributivity of the upper semilattices of the degrees below \(0'\)

Cites work

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

Cited in

(7)

• Semilattices which must contain a copy of \(2^ N\)
• On fairly low and superlow sets
• The structure of computably enumerable preorder relations
• Some properties of the upper semilattice of computable families of computably enumerable sets
• A classification of low c.e. sets and the Ershov hierarchy
• Weak presentations of computable ordered semigroups
• scientific article; zbMATH DE number 4081536 (Why is no real title available?)

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

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