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.
Preservation of Suslin trees and side conditions
Venturi G
2016-01-01
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
preservation_of_suslin_trees_and_side_conditions.pdf
non disponibili
Tipologia:
Versione finale editoriale
Licenza:
NON PUBBLICO - accesso privato/ristretto
Dimensione
167.46 kB
Formato
Adobe PDF
|
167.46 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
