On effectively hypersimple sets

DOI10.1007/BF02219827MaRDI QIDQ2560399zbMATH OpenOpenAlexFDO

Authors M. M. Arslanov

Publication date 1970

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/186738

Mathematics Subject Classification ID

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

Cites work

• A maximal set which is not complete
• A Simple Set Which is Not Effectively Simple
• Complete Recursively Enumerable Sets
• Completeness, the Recursion Theorem, and Effectively Simple Sets
• Effectively Simple Sets
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On a Class of Complete Simple Sets
• On the Lattice of Recursively Enumerable Sets
• Recursively enumerable sets of positive integers and their decision problems
• The Priority Method I
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

Cited in

(3)

• Marat Mirzaevich Arslanov (on his eightieth birthday)
• Unoids with finiteness conditions over computably separable equivalences
• Constructivity conditions on immune sets

This page was built for publication: On effectively hypersimple sets

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