Saccharinity with ccc
Logic
2025-05-28 v2
Abstract
Using creature technology, we construct families of Suslin ccc non-sweet forcing notions such that is equiconsistent with "every set of reals equals a Borel set modulo the -closure of the null ideal associated with "+"there is an -sequence of distinct reals". This answers a question of the second author and Kellner. As an application of independent interest, we also show how our forcing adds a new singleton over without relying on -combinatorics.
Keywords
Cite
@article{arxiv.1610.02706,
title = {Saccharinity with ccc},
author = {Haim Horowitz and Saharon Shelah},
journal= {arXiv preprint arXiv:1610.02706},
year = {2025}
}