Splitting theorems and low degrees

DOI10.3233/COM-180093MaRDI QIDQ5211064zbMATH OpenOpenAlexWikidataFDO

Authors Ellen S. Chih, Rodney G. Downey

Publication date 17 January 2020

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/com-180093

zbMATH Keywords

computably enumerable setdominationlownon-uniformitysplitting

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1523417
• Splitting theorems and the jump operator
• New Computational Paradigms
• On the Universal Splitting Property
• scientific article; zbMATH DE number 4023250

Cited in

(8)

• Splitting into degrees with low computational strength
• On splits of computably enumerable sets
• On the Universal Splitting Property
• scientific article; zbMATH DE number 1101532 (Why is no real title available?)
• Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable
• A Splitting with Infimum in the d-c. e. Degrees
• Degrees that Are Low for Isomorphism
• New Computational Paradigms

This page was built for publication: Splitting theorems and low degrees

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