On the Complexity of Analytic Sets

DOI10.1002/MALQ.19780242506zbMath0411.03040OpenAlexW2090546112MaRDI QIDQ4198745

Karel Hrbacek

Publication date: 1978

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19780242506

zbMATH Keywords

reducibilityBorel setconstructibilitycoanalytic setshigher type recursion theoryKleene degrees

Mathematics Subject Classification ID

Descriptive set theory (03E15) Inner models, including constructibility, ordinal definability, and core models (03E45) Other degrees and reducibilities in computability and recursion theory (03D30) Higher-type and set recursion theory (03D65)

Related Items (2)

High and low Kleene degrees of coanalytic sets ⋮ Analytic sets having incomparable kleene degrees

This page was built for publication: On the Complexity of Analytic Sets