2014/03/25 by Brent Cody, Cody, Brent, Sean Cox +1
Computer Science · Mathematics · #03E35 #03E55 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Mathematical and Theoretical Analysis
paper · pdf · doi:10.48550/arxiv.1403.6398
openalex publication_date 2014/03/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of ω1 is preserved by any proper forcing. We generalize portions of Foreman's Duality Theorem to the context of generic extender embeddings and ideal extenders (as introduced by Claverie in his PhD Thesis, Universitat Munster, 2010). As an application we prove that if ω1 is generically strong, then it remains so after adding any number of Cohen subsets of ω1; however many other ω1-closed posets---such as Col(ω1, ω2)---can destroy the generic strength of ω1. This generalizes some results of Gitik-Shelah about indestructibility of strong cardinals to the generically strong context. We also prove similar theorems for successor cardinals larger than ω1.