A variant proof of Con(b<a)
Logic
2014-09-26 v1
Abstract
We present a variation of the proof in the first author's "Mob families and mad families" of Con(b<a), which in particular removes some of the obstacles to generalising the argument to uncountable cardinals.
Cite
@article{arxiv.1404.2858,
title = {A variant proof of Con(b<a)},
author = {Jörg Brendle and Andrew D. Brooke-Taylor},
journal= {arXiv preprint arXiv:1404.2858},
year = {2014}
}
Comments
10 pages. To appear in the proceedings of the RIMS set theory workshop 2013