Π10 classes and Boolean combinations of recursively enumerable sets

DOI10.2307/2272348MaRDI QIDQ4774032zbMATHOpenAlexFDO

Authors Carl G. jun. Jockusch

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

Mathematics Subject Classification ID

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

Cites work

• Class groups of integral group rings
• Degrees of members of \(\Pi_ 1^ 0\) classes
• The degrees of bi‐immune sets

Cited in

(7)

• Measure theory and weak König's lemma
• TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS
• Immunity for closed sets
• Recursive coloration of countable graphs
• On the logical strengths of partial solutions to mathematical problems
• Recursively enumerable sets and degrees
• Δ 2 0 -Mengen

This page was built for publication: Π₁⁰ classes and Boolean combinations of recursively enumerable sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4774032)