BASIS THEOREMS FOR -SETS

DOI10.1017/jsl.2018.81zbMath1481.03033OpenAlexW2913127567MaRDI QIDQ4628687

Liuzhen Wu, Liang Yu, Chi Tat Chong

Publication date: 15 March 2019

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

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

zbMATH Keywords

constructibilityperfect setbasis theorempointed treesShoenfield absoluteness

Mathematics Subject Classification ID

Descriptive set theory (03E15) Consistency and independence results (03E35) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)

Cites Work

• Unnamed Item
• Recursion theory. Computational aspects of definability
• Perfect subsets of definable sets of real numbers
• Minimal Covers and Hyperdegrees
• Proof of a Conjecture of Friedman
• Π 1 2 Sets and Π 1 2 Singletons
• A Basis Theorem for Perfect Sets
• Set Theory
• The axiom of determinateness and reduction principles in the analytical hierarchy
• On the Cardinality of $$ \sum_2^1 $$ Sets of Reals
• Degrees of unsolvability of constructible sets of integers
• The fine structure of the constructible hierarchy