A model in which the base-matrix tree cannot have cofinal branches

DOI10.2307/2274354zbMath0637.03049OpenAlexW4232517224MaRDI QIDQ3778013

Peter Lars Dordal

Publication date: 1987

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274354

zbMATH Keywords

iterated forcingMathias forcingtowermodel of ZFCbase-matrix treedistributivity cardinal

Mathematics Subject Classification ID

Consistency and independence results (03E35) Models of arithmetic and set theory (03C62)

Related Items (14)

The combinatorics of splittability ⋮ Baire number of the spaces of uniform ultrafilters ⋮ Games on base matrices ⋮ Continuum cardinals generalized to Boolean algebras ⋮ Special ultrafilters and cofinal subsets of \(({}^\omega \omega, <^*)\) ⋮ Playing with Mathias ⋮ P-filters and Cohen, random, and Laver forcing ⋮ Subsets of \({}^ \omega\omega\) and the Fréchet-Urysohn and \(\alpha_ i\)-properties ⋮ Base tree property ⋮ Distributivity of the algebra of regular open subsets of \(\beta\mathbb R\setminus \mathbb R\) ⋮ Towers in \([\omega^{\omega}\) and \(^{\omega}\omega\)] ⋮ On first countable, countably compact spaces. II: Remainders in a van Douwen construction and P-ideals ⋮ Property \({(\hbar)}\) and cellularity of complete Boolean algebras ⋮ Ultrafilters on 𝜔-their ideals and their cardinal characteristics

This page was built for publication: A model in which the base-matrix tree cannot have cofinal branches