There is no plus-capping degree

DOI10.1007/BF01352932MaRDI QIDQ1325049zbMATH OpenOpenAlexFDO

Authors Steffen Lempp, Rodney G. Downey

Publication date 7 July 1994

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01352932

zbMATH Keywords

plus-capping degreesrecursively enumerable degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Review text

The authors answer a question of Per Lindström. It is proved that there is no ``plus-capping degree, i.e. that for any incomplete r.e. degree \({\mathbf w}\), there is an incomplete r.e. degree \({\mathbf a}> {\mathbf w}\) such that there is no r.e. degree \({\mathbf v}> {\mathbf w}\) with \({\mathbf a}\cap {\mathbf v}= {\mathbf w}\).

Recommendations

• scientific article; zbMATH DE number 468962
• On a hierarchy of plus-cupping degrees
• Publication:3028997
• Highness, locally noncappability and nonboundings

Cites work

• Arithmetization of metamathematics in a general setting
• Minimal pairs in initial segments of the recursively enumerable degrees
• Non-bounding constructions
• On certain lattices of degrees of interpretability

Cited in

(1)

• Lattice nonembeddings and intervals of the recursively enumerable degrees

This page was built for publication: There is no plus-capping degree

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