Preservation of a Souslin tree and side conditions
Logic
2014-07-16 v1
Abstract
We show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions preserving a given Souslin tree T. The proof uses a Neeman style iteration with generalized side conditions consisting of models of two types, and a preservation theorem for such iterations. The consistency of this axiom was previously known by the standard countable support iteration, using a preservation theorem due to Miyamoto.
Cite
@article{arxiv.1407.4050,
title = {Preservation of a Souslin tree and side conditions},
author = {Giorgio Venturi},
journal= {arXiv preprint arXiv:1407.4050},
year = {2014}
}