vix.ing · top · new · best · stats · spec

Forcing, genericity and CBERS

2025/03/19 by Filippo Calderoni, Calderoni, Filippo, Dima Sinapova +1
Computer Science · Mathematics · #03E15 #03E40 #Advanced Algebra and Logic #Advanced Topology and Set Theory #FOS: Mathematics #Logic (math.LO) #Rings, Modules, and Algebras

paper · pdf · doi:10.48550/arxiv.2503.14811

openalex publication_date 2025/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we continue the study of equivalence of generics filters started by Smythe in [Smy22]. We fully characterize those forcing posets for which the corresponding equivalence of generics is smooth using the purely topological property of condensation. Next we leverage our characterization to show that there are non-homogeneous forcing for which equivalence of generics is not smooth. Then we prove hyperfiniteness in the case of Prikry forcing and some additional results addressing the problem whether generic equivalence for Cohen forcing is hyperfinite.

Related