On effectively hypersimple sets

DOI10.1007/BF02219827zbMath0261.02027OpenAlexW2095495835MaRDI QIDQ2560399

Marat 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

• Unnamed Item
• A maximal set which is not complete
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• On the Lattice of Recursively Enumerable Sets
• The Priority Method I
• A Simple Set Which is Not Effectively Simple
• Complete Recursively Enumerable Sets
• Effectively Simple Sets
• On a Class of Complete Simple Sets
• Completeness, the Recursion Theorem, and Effectively Simple Sets
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: On effectively hypersimple sets