The Meta-R.E. sets, but not the Π11 sets, can be enumerated without repetition
From MaRDI portal
Publication:5631088
DOI10.2307/2270513zbMath0225.02026OpenAlexW2108832968MaRDI QIDQ5631088
Publication date: 1970
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270513
Related Items (7)
Numberings in the analytical hierarchy ⋮ Computable positive and Friedberg numberings in hyperarithmetic ⋮ Positive presentations of families in relation to reducibility with respect to enumerability ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ Computable numberings of families of infinite sets ⋮ On a positive set theory with inequality ⋮ Partial decidable presentations in hyperarithmetic
This page was built for publication: The Meta-R.E. sets, but not the Π11 sets, can be enumerated without repetition
