On a Class of Complete Simple Sets

DOI10.4153/CMB-1965-006-2zbMath0207.30701MaRDI QIDQ5607999

Thomas G. McLaughlin

Publication date: 1965

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Mathematics Subject Classification ID

Computability and recursion theory (03D99)

Related Items (6)

Semirecursive Sets and Positive Reducibility ⋮ Completeness, the Recursion Theorem, and Effectively Simple Sets ⋮ On the structures inside truth-table degrees ⋮ Recursively enumerable sets and degrees ⋮ On effectively hypersimple sets ⋮ On \(sQ\)-completeness of recursively enumerable sets

This page was built for publication: On a Class of Complete Simple Sets