Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"computable structure theory"”.

  1. Computable structure theory of continuous logic

    This dissertation examines computable structure theory relative to continuous logic. Due to the continuous nature of the relevant structures and space of truth values, special care is required to translate and modify results given in classical computable structure theory to the continuous setting. …

    iastate Repository record for Computable structure theory of continuous logic (opens in a new tab)

  2. Computable structure theory on Banach spaces

    … and sufficient condition for the existence of computable isometric isomorphisms between any two computable representations of the purely atomic $L^p$-spaces (e.g. $\ell^p$) where the underlying measure space is generated by finitely many atoms. In the case where the underlying measure space is …

    iastate Repository record for Computable structure theory on Banach spaces (opens in a new tab)

  3. Notions of Complexity Within Computable Structure Theory

    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 metatheorem of Antonio Montalb\'an's to simplify an otherwise difficult priority …

    waterloo Repository record for Notions of Complexity Within Computable Structure Theory (opens in a new tab)

  4. Computable Reducibility of Equivalence Relations

    Computable reducibility of equivalence relations is a tool to compare the complexity of equivalence relations on natural numbers. Its use is important to those doing Borel equivalence relation theory, computability theory, and computable structure theory. In this thesis, we compare many naturally …

    boise Repository record for Computable Reducibility of Equivalence Relations (opens in a new tab)

  5. Computability Theory and Some Applications

    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 notion of the bounded Turing hierarchy. In Chapter 2 (joint with Csima, …

    waterloo Repository record for Computability Theory and Some Applications (opens in a new tab)

  6. Complexity of Classes of Structures

    … 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, …

    waterloo Repository record for Complexity of Classes of Structures (opens in a new tab)

  7. Reducibility, Degree Spectra, and Lowness in Algebraic Structures

    This dissertation addresses questions in computable structure theory, which is a branch of mathematical logic hybridizing computability theory and the study of familiar mathematical structures. We focus on algebraic structures, which are standard topics of discussion among model theorists. The …

    cuny-grad Repository record for Reducibility, Degree Spectra, and Lowness in Algebraic Structures (opens in a new tab)

  8. Degree Spectra of Unary relations on ω and ζ

    … set of Turing degrees of the image of X in all computable presentations of (ω,<). Many results are known about the types of degree spectra that are possible for relations forming infinite and coinfinite c.e. sets, high c.e. sets and non-high c.e. sets on the standard copy. We show that if the …

    waterloo Repository record for Degree Spectra of Unary relations on ω and ζ (opens in a new tab)

  9. Computability Theoretic Aspects of Profinite Groups and Models of Presburger Arithmetic

    … on the complexity of the entire first order theory. Additionally, given a profinite subgroup $G$ and a Turing ideal $I$ we define $G_I$ to be the set of elements in $G$ whose Turing degree lies in $I$. We examine to what extent and under what conditions $G_I$ will be an elementary subgroup of …

    cuny-grad Repository record for Computability Theoretic Aspects of Profinite Groups and Models of Presburger Arithmetic (opens in a new tab)