scientific article

zbMATH Open0542.03021MaRDI QIDQ3329451

Richard A. Shore

Publication date: 1982

Title of this publication is not available (Why is that?)

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)

Related Items (1)

Cupping and noncapping in the r.e. weak truth table and turing degrees

Recommendations

• Title not available (Why is that?) 👍 👎
• Definability in the Turing degrees 👍 👎
• Infimum properties differ in the weak truth-table degrees and the Turing degrees 👍 👎
• The \(\omega\)-Turing degrees 👍 👎
• On the structures inside truth-table degrees 👍 👎
• Decidability and undecidability in the enumerable Turing degrees 👍 👎
• The Turing degrees below generics and randoms 👍 👎
• Complementation in the Turing degrees 👍 👎
• The arithmetic and Turing degrees are not elementarily equivalent 👍 👎
• Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees 👍 👎

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)