2024/09/05 by Desmond Lau, Lau, Desmond
Engineering · #Advanced Numerical Analysis Techniques
paper · pdf · doi:10.48550/arxiv.2409.03441
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.