On \(\Pi{}^ 0_ 1\) classes and their ranked points

DOI10.1305/NDJFL/1093635924zbMath0753.03016OpenAlexW2008088982MaRDI QIDQ1182688

Rodney G. Downey

Publication date: 28 June 1992

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093635924

zbMATH Keywords

Turing degreescompletely ranked degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (11)

A rank one cohesive set ⋮ Bounded Randomness ⋮ CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS ⋮ Countable thin \(\Pi^0_1\) classes ⋮ Π₁⁰ classes and strong degree spectra of relations ⋮ On the degree spectrum of a $\Pi ^0_1$ class ⋮ Arithmetical Sacks forcing ⋮ A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE ⋮ The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees ⋮ On trees without hyperimmune branches ⋮ On the Cantor-Bendixon rank of recursively enumerable sets

This page was built for publication: On \(\Pi{}^ 0_ 1\) classes and their ranked points