One class of partial sets

DOI10.1007/BF01098896MaRDI QIDQ1253250zbMATH OpenFDO

Authors S. S. Marchenkov

Publication date 1976

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01098896

zbMATH Keywords

Recursively EnumerableSemirecursive Hyperhyper Simple Set

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Recursively enumerable sets of positive integers and their decision problems
• Semirecursive Sets and Positive Reducibility

Cited in

(15)

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

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

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