Generating sets for the recursively enumerable Turing degrees

MaRDI QIDQ3530389zbMATH OpenFDO

Authors Klaus Ambos-Spies, Steffen Lempp, Theodore A. Slaman

Publication date 20 October 2008

zbMATH Keywords

generating setsjoinTuring degreesrecursively enumerable degreesmeet

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3922635
• An extension of the recursively enumerable Turing degrees
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
• The structures inside Turing degrees of recursively enumerable generic sets
• Structural interactions of the recursively enumerable T- and W-degrees

Cited in

(3)

• Computably enumerable Turing degrees and the meet property
• scientific article; zbMATH DE number 3922635 (Why is no real title available?)
• An extension of the recursively enumerable Turing degrees

This page was built for publication: Generating sets for the recursively enumerable Turing degrees

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