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

zbMATH Open0830.03018MaRDI QIDQ1897906FDOQ1897906

Authors: Sh. T. Ishmukhametov 

Publication date: 17 September 1995

Published in: Russian Mathematics (Search for Journal in Brave)

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
• scientific article; zbMATH DE number 3959402

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)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Turing Definability in the Ershov Hierarchy
• Jumps of nontrivial splittings of recursively enumerable sets

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)