Diagonals and semihyperhypersimple sets

DOI10.2307/2275073zbMath0747.03019OpenAlexW2077107644MaRDI QIDQ3985103

No author found.

Publication date: 27 June 1992

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275073

zbMATH Keywords

diagonalscomputable numberingsnumbering of partial recursive functionssemi-hyperhypersimple setsTuring-degree

Mathematics Subject Classification ID

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

Related Items (4)

On Splits of Computably Enumerable Sets ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets ⋮ Some orbits for \({\mathcal E}\) ⋮ Splitting theorems in recursion theory

This page was built for publication: Diagonals and semihyperhypersimple sets