## Complexity of Classes of Structures

dc.contributor.author | Knoll, Carolyn Alexis | |

dc.date.accessioned | 2013-08-28 13:54:42 (GMT) | |

dc.date.available | 2013-08-28 13:54:42 (GMT) | |

dc.date.issued | 2013-08-28T13:54:42Z | |

dc.date.submitted | 2013 | |

dc.identifier.uri | http://hdl.handle.net/10012/7750 | |

dc.description.abstract | The main theme of this thesis is studying classes of structures with respect to various measurements of complexity. We will briefly discuss the notion of computable dimension, while the breadth of the paper will focus on calculating the Turing ordinal and the back-and-forth ordinal of various classes, along with an exploration of how these two ordinals are related in general. Computable structure theorists study which computable dimensions can be realized by structures from a given class. Using a structural characterization of the computably categorical equivalence structures due to Calvert, Cenzer, Harizanov and Morozov, we prove that the only possible computable dimension of an equivalence structure is 1 or ω. In 1994, Jockusch and Soare introduced the notion of the Turing ordinal of a class of structures. It was unknown whether every computable ordinal was the Turing ordinal of some class. Following the work of Ash, Jocksuch and Knight, we show that the answer is yes, but, as one might expect, the axiomatizations of these classes are complex. In 2009, Montalban defined the back-and-forth ordinal of a class using the back-and-forth relations. Montalban, following a result of Knight, showed that if the back-and-forth ordinal is n+1, then the Turing ordinal is at least n. We will prove a theorem stated by Knight that extends the previous result to all computable ordinals and show that if the back-and-forth ordinal is α (infinite) then the Turing ordinal is at least α. It is conjectured at present that if a class of structures is relatively nice then the Turing ordinal and the back-and-forth ordinal of the class differ by at most 1. We will present many examples of classes having axiomatizations of varying complexities that support this conjecture; however, we will show that this result does not hold for arbitrary Borel classes. In particular, we will prove that there is a Borel class with infinite Turing ordinal but finite back-and-forth ordinal and show that, for each positive integer d, there exists a Borel class of structures such that the Turing ordinal and the back-and-forth ordinal of the class are both finite and differ by at least d. | en |

dc.language.iso | en | en |

dc.publisher | University of Waterloo | en |

dc.subject | Computable structure theory | en |

dc.title | Complexity of Classes of Structures | en |

dc.type | Doctoral Thesis | en |

dc.pending | false | en |

dc.subject.program | Pure Mathematics | en |

uws-etd.degree.department | Pure Mathematics | en |

uws-etd.degree | Doctor of Philosophy | en |

uws.typeOfResource | Text | en |

uws.peerReviewStatus | Unreviewed | en |

uws.scholarLevel | Graduate | en |