2017/10/07 by Omer Ben-Neria, Ben-Neria, Omer
Computer Science · Mathematics · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Mathematical and Theoretical Analysis
paper · pdf · doi:10.48550/arxiv.1710.02713
openalex publication_date 2017/10/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the notion of tightly stationary sets which was introduced by\nForeman and Magidor in citeForMag-MS. We obtain two consistency results\nwhich show that it is possible for a sequence of regular cardinals ( \κn\n)n < \ω to have the property that for every sequence \S, of some\nfixed-cofinality stationary sets Sn \⊆ \κn, \S is tightly\nstationary in a generic extension. The results are obtained using variations of\nthe short-extenders forcing method.\n