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 4 of 4 for “"Computable model theory"”.

  1. Computable Model Theory on Loops

    We give an introduction to the problem of computable algebras. Specifically, the algebras of loops and groups. We start by defining a loop and group, then give some of their properties. We then give an overview of comptability theory, and apply it to loops and groups. We conclude by showing that a …

    nmu Repository record for Computable Model Theory on Loops (opens in a new tab)

  2. A STUDY OF RANDOMNESS AND GROUPS USING FINITE AUTOMATA

    … Randomness, while that for groups is taken from Computable Model Theory. A study of randomness in this thesis proceeds in several directions. Firstly, automatic randomness tests are introduced as a measure-theoretic tool to detect randomness. Secondly, globally automatic supermartingales are …

    nus Repository record for A STUDY OF RANDOMNESS AND GROUPS USING FINITE AUTOMATA (opens in a new tab) Download file for A STUDY OF RANDOMNESS AND GROUPS USING FINITE AUTOMATA (opens in a new tab)

  3. Computability and Structure

    … of constructive mathematics with emphasis to computable algebra and computable analysis. Mal'cev [66] and Rabin [86] initiated the study of computable groups, and Turing [96, 95] started the investigation of effective procedures in analysis. The thesis in hand is divided into two parts. Part I …

    auckland-ms Repository record for Computability and Structure (opens in a new tab)

  4. Computability and Complexity Properties of Automatic Structures and their Applications

    … structures via well-established concepts from model theory, topology, and set theory. We prove the following results. The ordinal height of any automatic well-founded partial order is bounded by \omega^\omega. The ordinal heights of automatic well-founded relations are unbounded below the first …

    cornell Repository record for Computability and Complexity Properties of Automatic Structures and their Applications (opens in a new tab)