Forcing indestructibility of set-theoretic axioms
Logic
2007-05-23 v1
Abstract
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add generic countable sequences high up in the set-theoretic hierarchy even before collapsing everything down to . Later we give applications, among them the consistency of with not being Jonsson which answers a question raised during Oberwolfach 2005.
Cite
@article{arxiv.math/0605129,
title = {Forcing indestructibility of set-theoretic axioms},
author = {Bernhard Koenig},
journal= {arXiv preprint arXiv:math/0605129},
year = {2007}
}