A semilattice generated by superlow computably enumerable degrees

DOI10.3103/S1066369X11010087zbMATH Open1225.03053OpenAlexW2067197646MaRDI QIDQ646847FDOQ646847

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

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'\)

zbMATH Keywords

low degreescritical triplessuperlow degreestotally c. e. degrees

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• On fairly low and superlow sets
• Title not available (Why is that?)
• 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
• Semilattices which must contain a copy of \(2^ N\)
• The structure of computably enumerable preorder relations

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)