Π10 classes and Boolean combinations of recursively enumerable sets
From MaRDI portal
Publication:4774032
DOI10.2307/2272348zbMath0286.02045OpenAlexW2171901999MaRDI QIDQ4774032
Publication date: 1974
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272348
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)
Related Items
Measure theory and weak König's lemma ⋮ Recursive coloration of countable graphs ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ Immunity for Closed Sets ⋮ TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS ⋮ Δ 2 0 -Mengen ⋮ Recursively enumerable sets and degrees
Cites Work
This page was built for publication: Π10 classes and Boolean combinations of recursively enumerable sets