Forcing as a Local Method of Accessing Small Extensions
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916546402582528 |
|---|---|
| author | Lau, Desmond |
| author_facet | Lau, Desmond |
| contents | Fix a set-theoretic universe $V$. We look at small extensions of $V$ as generalised degrees of computability over $V$. We also formalise and investigate the complexity of certain methods one can use to define, in $V$, subclasses of degrees over $V$. Finally, we give a nice characterisation of the complexity of forcing within this framework. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_03441 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Forcing as a Local Method of Accessing Small Extensions Lau, Desmond Logic 03E40 (Primary) 03D30 (Secondary) F.4.1 Fix a set-theoretic universe $V$. We look at small extensions of $V$ as generalised degrees of computability over $V$. We also formalise and investigate the complexity of certain methods one can use to define, in $V$, subclasses of degrees over $V$. Finally, we give a nice characterisation of the complexity of forcing within this framework. |
| title | Forcing as a Local Method of Accessing Small Extensions |
| topic | Logic 03E40 (Primary) 03D30 (Secondary) F.4.1 |
| url | https://arxiv.org/abs/2409.03441 |