Π10 classes and Boolean combinations of recursively enumerable sets
From MaRDI portal
Publication:4774032
DOI10.2307/2272348zbMath0286.02045MaRDI 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
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
03D55: Hierarchies of computability and definability
Related Items
On the logical strengths of partial solutions to mathematical problems, TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS, Recursive coloration of countable graphs, Measure theory and weak König's lemma, Immunity for Closed Sets, Δ 2 0 -Mengen, Recursively enumerable sets and degrees
Cites Work