Towards a theory of symmetric extensions
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910026959945728 |
|---|---|
| author | Karagila, Asaf Schilhan, Jonathan |
| author_facet | Karagila, Asaf Schilhan, Jonathan |
| contents | The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique remained fairly limited compared to the theory of forcing. Whereas forcing developed products and iterations, no serious attempts at developing any general framework for iterating symmetric extensions were presented before [10], where only finite support iterations are treated. In this paper we develop the theory of symmetric extensions including different types of iterations, quotients, equivalents, and the structural results that can be described in this language. In particular, we give a modern exposition to some of the important theorems of Grigorieff [3], study Kinna--Wagner Principles in symmetric extensions, and show that it is provable from $\mathsf{ZF}$ that every set lies in a symmetric extension of $\operatorname{HOD}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_17338 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Towards a theory of symmetric extensions Karagila, Asaf Schilhan, Jonathan Logic Primary 03E35, Secondary 03E25, 03E40 The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique remained fairly limited compared to the theory of forcing. Whereas forcing developed products and iterations, no serious attempts at developing any general framework for iterating symmetric extensions were presented before [10], where only finite support iterations are treated. In this paper we develop the theory of symmetric extensions including different types of iterations, quotients, equivalents, and the structural results that can be described in this language. In particular, we give a modern exposition to some of the important theorems of Grigorieff [3], study Kinna--Wagner Principles in symmetric extensions, and show that it is provable from $\mathsf{ZF}$ that every set lies in a symmetric extension of $\operatorname{HOD}$. |
| title | Towards a theory of symmetric extensions |
| topic | Logic Primary 03E35, Secondary 03E25, 03E40 |
| url | https://arxiv.org/abs/2602.17338 |