scientific article; zbMATH DE number 1531934

MaRDI QIDQ4513977zbMATH OpenFDO

Authors Richard A. Shore

Publication date 19 November 2000

zbMATH Keywords

recursively enumerable degreesTuring degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55) Inner models, including constructibility, ordinal definability, and core models (03E45)

Recommendations

• Definability degrees
• Definability in the enumeration degrees
• scientific article; zbMATH DE number 510777
• Definability in the Recursively Enumerable Degrees
• scientific article; zbMATH DE number 6984345
• The natural hierarchy and quasi-hierarchy of constructibility degrees
• Definability in classes of finite structures
• The search for natural definability in the Turing degrees
• Definable relations in Turing degree structures
• Definable relations in Turing degree structures

Cited in

(9)

• On definable filters in computably enumerable degrees
• The natural hierarchy and quasi-hierarchy of constructibility degrees
• Hierarchy of Computably Enumerable Degrees II
• scientific article; zbMATH DE number 1531930 (Why is no real title available?)
• The information content of typical reals
• A hierarchy of computably enumerable degrees
• The search for natural definability in the Turing degrees
• Naturality and definability II
• Embeddings of N₅ and the contiguous 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 Q4513977)