Browsing Mathematics (Faculty of) by Supervisor "Csima, Barbara"
Now showing items 1-3 of 3
-
Computability Theory and Some Applications
(University of Waterloo, 2019-07-15)We explore various areas of computability theory, ranging from applications in computable structure theory primarily focused on problems about computing isomorphisms, to a number of new results regarding the degree-theoretic ... -
Degrees of Categoricity and the Isomorphism Problem
(University of Waterloo, 2019-06-12)In this thesis, we study notions of complexity related to computable structures. We first study degrees of categoricity for computable tree structures. We show that, for any computable ordinal $\alpha$, there exists a ... -
Notions of Complexity Within Computable Structure Theory
(University of Waterloo, 2023-08-28)This thesis covers multiple areas within computable structure theory, analyzing the complexities of certain aspects of computable structures with respect to different notions of definability. In chapter 2 we use a new ...