3 papers
cs.LO2025
Relative Constructibility via Generalised Sequential Algorithms
Desmond Lau
We modify Gurevich's definition of sequential algorithms, so that it becomes amenable to computation with arbitrarily large sets on a sufficiently intuitive level. As a result, two…
math.LO2024
Forcing as a Local Method of Accessing Small Extensions
Desmond Lau
Fix a set-theoretic universe . We look at small extensions of as generalised degrees of computability over . We also formalise and investigate the complexity of certain m…
math.LO2024
Forcing with Language Fragments, Extending Namba Forcing, and Models of Theories with Constraints in Interpretation
Desmond Lau
We develop a forcing framework based on the idea of amalgamating language fragments into a theory with a canonical term model. We then demonstrate the usefulness of this framework…