One class of partial sets

DOI10.1007/BF01098896zbMath0396.03035MaRDI QIDQ1253250

Sergey S. Marchenkov

Publication date: 1976

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Recursively EnumerableSemirecursive Hyperhyper Simple Set

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (12)

r‐Maximal sets and Q1,N‐reducibility ⋮ Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility ⋮ Hyperhypersimple sets and Q₁ -reducibility ⋮ \(sQ_1\)-degrees of computably enumerable sets ⋮ \(Q _{1}\)-degrees of c.e. sets ⋮ Irreducible, singular, and contiguous degrees ⋮ Structural properties of \(Q\)-degrees of n-c.e. sets ⋮ On the bounded quasi‐degrees of c.e. sets ⋮ Strong reducibilities ⋮ Cappable recursively enumerable degrees and Post's program ⋮ Classes bounded by incomplete sets ⋮ \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets

Cites Work

• Unnamed Item
• Semirecursive Sets and Positive Reducibility
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: One class of partial sets