English

Template iterations with non-definable ccc forcing notions

Logic 2015-06-23 v4

Abstract

We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if κ\kappa is a measurable cardinal and θ<κ<μ<λ\theta<\kappa<\mu<\lambda are uncountable regular cardinals, then there is a ccc poset forcing s=θ<b=μ<a=λ\mathfrak{s}=\theta<\mathfrak{b}=\mu<\mathfrak{a}=\lambda. Another application is to get models with large continuum where the groupwise-density number g\mathfrak{g} assumes an arbitrary regular value.

Keywords

Cite

@article{arxiv.1305.4740,
  title  = {Template iterations with non-definable ccc forcing notions},
  author = {Diego Alejandro Mejía},
  journal= {arXiv preprint arXiv:1305.4740},
  year   = {2015}
}

Comments

To appear in the Annals of Pure and Applied Logic, 45 pages, 2 figures

R2 v1 2026-06-22T00:19:37.957Z