Generating sets for the recursively enumerable Turing degrees

zbMATH Open1156.03039MaRDI QIDQ3530389FDOQ3530389

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

Publication date: 20 October 2008

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

zbMATH Keywords

generating setsjoinTuring degreesrecursively enumerable degreesmeet

Mathematics Subject Classification ID

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

Cited In (3)

• An extension of the recursively enumerable Turing degrees
• Computably enumerable Turing degrees and the meet property
• Title not available (Why is that?)

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)