Equivalence of generics
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914876588294144 |
|---|---|
| author | Smythe, Iian B. |
| author_facet | Smythe, Iian B. |
| contents | Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We examine the complexity of this equivalence relation for various partial orders, with particular focus on Cohen and random forcing. We prove, amongst other results, that the former is an increasing union of countably many hyperfinite Borel equivalence relations, while the latter is neither amenable nor treeable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1810_04704 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Equivalence of generics Smythe, Iian B. Logic 03E15 (Primary), 03E40 (Primary), 37A20 (Secondary) Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We examine the complexity of this equivalence relation for various partial orders, with particular focus on Cohen and random forcing. We prove, amongst other results, that the former is an increasing union of countably many hyperfinite Borel equivalence relations, while the latter is neither amenable nor treeable. |
| title | Equivalence of generics |
| topic | Logic 03E15 (Primary), 03E40 (Primary), 37A20 (Secondary) |
| url | https://arxiv.org/abs/1810.04704 |