A more direct proof of a result of Shelah

DOI10.1016/0168-0072(91)90023-FzbMath0744.03049OpenAlexW2094225299MaRDI QIDQ1182476

Winfried Just

Publication date: 28 June 1992

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(91)90023-f

zbMATH Keywords

forcingmaximal idealgameRamsey ultrafilter

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (1)

Ramsey ultrafilters and the reaping number - Con(\({\mathfrak r}<{\mathfrak u}\))

Cites Work

• Ramsey ultrafilters and the reaping number - Con(\({\mathfrak r}<{\mathfrak u}\))

This page was built for publication: A more direct proof of a result of Shelah