Year: 2024
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Author: Lau, Desmond
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4403556414