paper

Saccharinity with ccc

arXiv:1610.02706 · doi:10.1017/jsl.2026.10215

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.

Cited by in corpus (1)