Forcing indestructibility of set-theoretic axioms

dc.creatorKoenig, Bernhard
dc.date2006-05-04
dc.date.accessioned2026-07-07T07:13:55Z
dc.date.available2026-07-07T07:13:55Z
dc.descriptionVarious 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 $\aleph\_1$. Later we give applications, among them the consistency of ${\rm MM}$ with $\aleph\_ω$ not being Jonsson which answers a question raised during Oberwolfach 2005.
dc.identifierhttps://arxiv.org/abs/math/0605129
dc.identifierhttp://arxiv.org/abs/math/0605129
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112664
dc.subjectLogic
dc.titleForcing indestructibility of set-theoretic axioms
dc.typetext

Files

Collections