Date of Completion
logic, computability theory, recursion theory, computable structure theory, low for isomorphism
David Reed Solomon
Field of Study
Doctor of Philosophy
We explore the notion of lowness for isomorphism as restricted to various classes and subclasses of structures. We present results for equivalence structures, scattered linear orders, the non-scattered linear orders known as shuffle sums, and for various restrictions of these classes, with an emphasis on examining which properties, in general terms, of these structures play a role in which results and how changes to the various constructions affect the resulting structures. Finally, we present partial information on the relationships between the various types of results and their associated subclasses of structures, with notes on how we might expect these results to generalize.
Suggs, Jacob D., "On Lowness for Isomorphism as Restricted to Classes of Structures" (2015). Doctoral Dissertations. 712.