Near coherence of filters. III: A simplified consistency proof

From MaRDI portal
Publication:914666

DOI10.1305/ndjfl/1093635236zbMath0702.03030OpenAlexW2045768638MaRDI QIDQ914666

Saharon Shelah, Andreas Blass

Publication date: 1989

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093635236




Related Items (26)

Every maximal ideal may be Katětov above of all 𝐹_{𝜎} idealsMathias Forcing which does not Add Dominating RealsTukey types of ultrafiltersFinding generic filters by playing gamesProducts of Menger spaces in the Miller modelMany countable support iterations of proper forcings preserve Souslin trees\(M\)-separable spaces of functions are productive in the Miller modelWhat makes the continuum ℵ₂Coideals as remainders of groups distinguishing between combinatorial covering propertiesExactly two and exactly three near-coherence classes-ULTRAFILTERS IN THE RATIONAL PERFECT SET MODELSpecial ultrafilters and cofinal subsets of \(({}^\omega \omega, <^*)\)On embedding certain partial orders into the P-points under Rudin-Keisler and Tukey reducibilityGroupwise density and related cardinalsP-filters and Cohen, random, and Laver forcingSacks forcing, Laver forcing, and Martin's axiomA continuum without non-block pointsCardinal characteristics for Menger-bounded subgroupsTHE FILTER DICHOTOMY AND MEDIAL LIMITSSet Theory and C*-AlgebrasThere may be infinitely many near-coherence classes underu< ∂TOWERS IN FILTERS, CARDINAL INVARIANTS, AND LUZIN TYPE FAMILIESThe cofinality of the symmetric group and the cofinality of ultrapowersThe near coherence of filters principle does not imply the filter dichotomy principlePreservation of 𝛾-spaces and covering properties of productsFilter games and pathological subgroups of a countable product of lines




This page was built for publication: Near coherence of filters. III: A simplified consistency proof