Hyper-hyperfiniteness and complexity
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914956793872384 |
|---|---|
| author | Frisch, Joshua Shinko, Forte Vidnyanszky, Zoltan |
| author_facet | Frisch, Joshua Shinko, Forte Vidnyanszky, Zoltan |
| contents | We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely, $Σ^1_2$-complete. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_16445 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Hyper-hyperfiniteness and complexity Frisch, Joshua Shinko, Forte Vidnyanszky, Zoltan Logic 03E15 We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely, $Σ^1_2$-complete. |
| title | Hyper-hyperfiniteness and complexity |
| topic | Logic 03E15 |
| url | https://arxiv.org/abs/2409.16445 |