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

DOI10.2307/2274354zbMath0637.03049MaRDI 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 forcing; Mathias forcing; tower; model of ZFC; base-matrix tree; distributivity cardinal

Mathematics Subject Classification ID

03E35: Consistency and independence results

03C62: Models of arithmetic and set theory

Related Items

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