eScholarship (California Digital Library) · 2016 · 17 citations · 3 references
Open access
Natural SciencesComputer ScienceMathematicsPhilosophy Of MathematicsSet TheoryTheory Of ComputationComputability TheoryOrdinal NumbersSet-theoretic TopologyComputabilityComputable Structure TheoryForcing In Computability TheoryHigher-order ComputabilitySet-theoretic DualityUncountable Set
In this thesis, we explore connections between computability theory and set theory. We investigate an extension of reverse mathematics to a higher-order context, focusing in particular on determinacy principles, and an extension of computable structure theory to uncountable structures via set-theoretic forcing. We also look at computability-theoretic operations induced by ultrafilters, and the classical computable structure theory of ordinals as clarified by set-theoretic results.
3