scientific article; zbMATH DE number 1390016

MaRDI QIDQ4934281zbMATH OpenFDO

Authors Richard A. Shore

Publication date 7 November 2000

zbMATH Keywords

recursively enumerable degreessurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Definability in the Recursively Enumerable Degrees
• scientific article; zbMATH DE number 841089
• Interpretability and Definability in the Recursively Enumerable Degrees
• scientific article; zbMATH DE number 4057497
• Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability}

Cited in

(12)

• Cappable recursively enumerable degrees and Post's program
• Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability}
• Cellular automata and intermediate degrees.
• Interpreting true arithmetic in the theory of the r.e. truth table degrees
• scientific article; zbMATH DE number 5000253 (Why is no real title available?)
• A hierarchy of families of recursively enumerable degrees
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• An extension of the recursively enumerable Turing degrees
• Weak density and cupping in the d-r.e. degrees
• Undecidability and 1-types in the recursively enumerable degrees
• Model-theoretic properties of Turing degrees in the Ershov difference hierarchy

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 Q4934281)