scientific article; zbMATH DE number 3861135

MaRDI QIDQ3329451zbMATH OpenFDO

Authors Richard A. Shore

Publication date 1982

zbMATH Keywords

coneprincipal filterTuring degreestt-degreescreative set

Mathematics Subject Classification ID

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

Recommendations

• The arithmetic and Turing degrees are not elementarily equivalent
• Infimum properties differ in the weak truth-table degrees and the Turing degrees
• Minimal weak truth table degrees and computably enumerable Turing degrees
• Turing degrees and the Ershov hierarchy
• Definability in the Turing degrees
• Complementation in the Turing degrees
• Decidability and undecidability in the enumerable Turing degrees
• On the structures inside truth-table degrees
• The \(\omega\)-Turing degrees
• The Turing degrees below generics and randoms

Cited in

(3)

• Automorphisms of the truth-table degrees are fixed on a cone
• Cupping and noncapping in the r.e. weak truth table and turing degrees
• The arithmetic and Turing degrees are not elementarily equivalent

This page was built for publication:

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