2014/08/24 by Sy‐David Friedman, Friedman, Sy-David, Yurii Khomskii +3
Computer Science · Mathematics · #03E05 #03E15 #03E30 #03E40 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Mathematical and Theoretical Analysis
paper · pdf · doi:10.48550/arxiv.1408.5582
openalex publication_date 2014/08/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We investigate regularity properties derived from tree-like forcing notions in the setting of "generalized descriptive set theory", i.e., descriptive set theory on κκ and 2κ, for regular uncountable cardinals κ.