Template iterations with non-definable ccc forcing notions

@article{Meja2015TemplateIW,
  title={Template iterations with non-definable ccc forcing notions},
  author={Diego Mej{\'i}a},
  journal={Ann. Pure Appl. Log.},
  year={2015},
  volume={166},
  pages={1071-1109}
}
  • D. Mejía
  • Published 21 May 2013
  • Mathematics
  • Ann. Pure Appl. Log.
View PDF on arXiv
12 Citations
Results Citations
1

Figures from this paper

12 Citations

Citation Type

Citation Type

Preservation properties for iterations with finite support
We present the classical theory of preservation of $\sqsubset$-unbounded families in generic extensions by ccc posets, where $\sqsubset$ is a definable relation of certain type on spaces of real…
Some Forcing Techniques : Ultrapowers , templates , and submodels
This is an expository paper about several sophisticated forcing techniques closed related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of…
Modern Forcing Techniques related to Finite Support Iteration: Ultrapowers, templates, and submodels
This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the following four topics:…
The ultrafilter and almost disjointness numbers
On cardinal characteristics of Yorioka ideals
TLDR
It is shown that, consistently, the additivity and cofinality of Yorioka ideals does not coincide with the addition and co finality of the ideal of Lebesgue measure zero subsets of the real line.
Matrix Iterations with Vertical Support Restrictions
  • D. Mej'ia
  • Mathematics
    Proceedings of the 14th and 15th Asian Logic Conferences
  • 2019
We use coherent systems of FS iterations on a power set, which can be seen as matrix iteration that allows restriction on arbitrary subsets of the vertical component, to prove general theorems about…
COHERENT SYSTEMS OF FINITE SUPPORT ITERATIONS
TLDR
A forcing technique to construct three-dimensional arrays of generic extensions through FS (finite support) iterations of ccc posets is introduced, which are referred to as 3D-coherent systems.
Filter-linkedness and its effect on preservation of cardinal characteristics
MAD families and strategically bounding forcings
Informally, a proper forcing $$\mathbb {P}$$ P is strategically bounding if there is a strategy to prove that $$\mathbb {P}$$ P is $$\omega ^{\omega }$$ ω ω -bounding. We prove that certain MAD…
Some models produced by
We use the techniques in [BFII, \mathrm{M}\mathrm{e}\mathrm{j}\mathrm{l}3\mathrm{b} , FFMM] to construct models, by three‐ dimensional arrays of ccc posets, where many classical cardinal…
...
1
2
...

References

SHOWING 1-10 OF 33 REFERENCES
Mad families, splitting families and large continuum
TLDR
Using a finite support iteration of ccc posets, if μ is a measurable cardinal and μ < κ < λ, then using similar techniques the authors obtain the consistency of .
TOOLS FOR YOUR FORCING CONSTRUCTION
A preservation theorem is a theorem of the form: "If hP�,Q� : � < �i is an iteration of forcing notions, and every Qsatisfies ' in V P� , then Psatisfies '." We give a simplified version of a general…
Models of some cardinal invariants with large continuum (Forcing extensions and large cardinals)
We extend the applications of the techniques used in Arch Math Logic 52:261-278, 2013, to present various examples of consistency results where some cardinal invariants of the continuum take…
Iterations of Boolean algebras with measure
TLDR
It is shown that M is closed under iterations with finite support and that the forcing via such an algebra does not destroy the Lebesgue measure structure from the ground model, and a simple characterization of Martin's Axiom is deduced.
Larger Cardinals in Cichon's Diagram
We prove that in many situations it is consistent with ZFC that part of the invariants involved in Cichon's diagram are equal to κ while the others are equal to λ , where κ λ are both arbitrary…
Adjoining Dominating Functions
If dominating functions in ω ω are adjoined repeatedly over a model of GCH via a finite-support c.c.c. iteration, then in the resulting generic extension there are no long towers, every well-ordered…
Matrix iterations and Cichon’s diagram
TLDR
Using matrix iterations of ccc posets, it is proved that it is consistent with ZFC to assign, at the same time, several arbitrary regular values on the left hand side of Cichon’s diagram.
INVARIANTS OF MEASURE AND CATEGORY
The purpose of this chapter is to discuss various results concerning the relationship between measure and category. The focus is on set-theoretic properties of the associated ideals, particularly,…
Ultrafilters with small generating sets
It is consistent, relative to ZFC, that the minimum number of subsets ofω generating a non-principal ultrafilter is strictly smaller than the dominating number. In fact, these two numbers can be any…
Set theory - an introduction to independence proofs
  • K. Kunen
  • Mathematics
    Studies in logic and the foundations of mathematics
  • 1983
TLDR
The Foundations of Set Theory and Infinitary Combinatorics are presented, followed by a discussion of easy Consistency Proofs and Defining Definability.
...
1
2
3
4
...