A class of hypersimple incomplete sets

DOI10.1007/BF01157017MaRDI QIDQ1078559zbMATH OpenOpenAlexFDO

Authors M. M. Arslanov

Publication date 1985

Published in Mathematical Notes (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25)

Review text

The paper is devoted to the study of hypersimple incomplete sets. A subclass of T-incomplete sets in the family of non-recursive, r.e. sets is introduced. It is shown that this class is not invariant with respect to automorphisms of the lattice of r.e. sets.

Recommendations

• scientific article; zbMATH DE number 4033723
• scientific article; zbMATH DE number 4116516
• Subsets of hypersimple sets
• scientific article; zbMATH DE number 4099278
• Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets

Cites work

• A Theorem on Hypersimple Sets
• Degrees of recursively enumerable sets which have no maximal supersets
• On the Lattice of Recursively Enumerable Sets
• Recursively enumerable sets of positive integers and their decision problems
• Semirecursive Sets and Positive Reducibility

Cited in

(4)

• Index sets of classes of hyper-hypersimple sets
• Classes bounded by incomplete sets
• scientific article; zbMATH DE number 1802815 (Why is no real title available?)
• Strong enumeration reducibilities

This page was built for publication: A class of hypersimple incomplete sets

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