COMPLEXITY OF INDEX SETS OF DESCRIPTIVE SET-THEORETIC NOTIONS

DOI10.1017/jsl.2022.2OpenAlexW4206451504MaRDI QIDQ5100042

Reese Johnston, Dilip Raghavan

Publication date: 29 August 2022

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2022.2

zbMATH Keywords

Borel setcomputabilityLebesgue measuredescriptive set theoryBaire propertyadmissible recursion

Mathematics Subject Classification ID

Descriptive set theory (03E15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Techniques of admissible recursion theory
• Infinite combinatorics and definability
• Turing Computability
• A co-analytic maximal set of orthogonal measures
• The complexity of maximal cofinitary groups
• Some additive properties of sets of real numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: COMPLEXITY OF INDEX SETS OF DESCRIPTIVE SET-THEORETIC NOTIONS