On decomposition of the 0' degree into lesser T-degrees containing differences of recursively enumerable sets

MaRDI QIDQ1897906zbMATHFDO

Authors Sh. T. Ishmukhametov

Publication date 17 September 1995

Published in Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

splittingd.r.e. degreesd.r.e. sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Splittings of 0' into the Recursively Enumerable Degrees
• A Splitting with Infimum in the d-c. e. Degrees
• scientific article; zbMATH DE number 1543034
• scientific article; zbMATH DE number 147666
• scientific article; zbMATH DE number 3959402

Cited in

(6)

• Turing Definability in the Ershov Hierarchy
• scientific article; zbMATH DE number 3916252 (Why is no real title available?)
• scientific article; zbMATH DE number 3959402 (Why is no real title available?)
• Jumps of nontrivial splittings of recursively enumerable sets
• scientific article; zbMATH DE number 1543034 (Why is no real title available?)
• scientific article; zbMATH DE number 4087649 (Why is no real title available?)

This page was built for publication: On decomposition of the \(0'\) degree into lesser \(T\)-degrees containing differences of recursively enumerable sets

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