Iterating symmetric extensions

Asaf Karagila

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)
10 Downloads (Pure)


The notion of a symmetric extension extends the usual notion of forcing by identifying a particular class of names which forms an intermediate model of  between the ground model and the generic extension, and often the axiom of choice fails in these models. Symmetric extensions are generally used to prove choiceless consistency results. We develop a framework for iterating symmetric extensions in order to construct new models of  . We show how to obtain some well-known and lesser-known results using this framework. Specifically, we discuss Kinna–Wagner principles and obtain some results related to their failure.
Original languageEnglish
Pages (from-to)123–159
Number of pages37
JournalJournal of Symbolic Logic
Issue number1
Early online date14 Mar 2019
Publication statusPublished - Mar 2019

Cite this