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 8 of 8 for “"Borel complexity"”.

  1. The Borel Complexity of Isomorphism for Some First Order Theories

    … relation for countable models be?"' Using the Borel reducibility framework, we investigate this question with regard to the space of countable models of particular complete first-order theories. We also investigate to what extent this complexity is mirrored in the number of back-and-forth …

    maryland Repository record for The Borel Complexity of Isomorphism for Some First Order Theories (opens in a new tab)

  2. Some Applications of Set Theory to Model Theory

    … we are interested in Keisler's order and Borel complexity. Keisler's order is a pre-order on complete countable theories $T$, measuring the saturation of ultrapowers of models of $T$. In Chapter~\ref{SurveyChapter}, we present a self-contained survey on Keisler's order. In …

    maryland Repository record for Some Applications of Set Theory to Model Theory (opens in a new tab)

  3. Operator Algebras and Abstract Classification

    … the notion of Polish groupoids and functorial complexity. Such a study is motivated by the fact that the categories of Elliott-classifiable algebras, Elliott invariants, abelian separable C*-algebras, and arbitrary separable C*-algebras have the same complexity according to the usual notion of …

    york Repository record for Operator Algebras and Abstract Classification (opens in a new tab)

  4. The Classification Problem for Models of ZFC

    … of ZFC are unclassifiable and have maximal complexity. The notions of complexity used in this thesis will be phrased in the language of Borel complexity theory. In particular, we will show that the class of countable models of ZFC is Borel complete. Most of the models in the construction as …

    boise Repository record for The Classification Problem for Models of ZFC (opens in a new tab)

  5. Classification of Vertex-Transitive Structures

    … complex when considered within the framework of Borel complexity. The tension between these two seemingly contradictory notions leads to a wealth of natural questions which have yet to be answered. Borel complexity theory is an area of logic where the relative complexities of classification …

    boise Repository record for Classification of Vertex-Transitive Structures (opens in a new tab)

  6. Nevanlinna-Pick Spaces and Dilations

    … varieties. In Chapter 5, we investigate the complexity of this classification problem from the point of view of Borel complexity theory. In Chapter 6, we show that the Hardy space on the unit disc is essentially the only Nevanlinna-Pick space whose multiplication operators are all hyponormal. …

    waterloo Repository record for Nevanlinna-Pick Spaces and Dilations (opens in a new tab)

  7. Descriptive Set Theory and Measure Theory in Locally Compact and Non-locally Compact Groups

    … the second section we consider the descriptive complexity of those subsets of the permutation group S? which arise naturally from the classical Levy-Steinitz series rearrangement theorem. We show that for any conditionally convergent series of vectors in Euclidean space, the sets of permutations …

    unt Repository record for Descriptive Set Theory and Measure Theory in Locally Compact and Non-locally Compact Groups (opens in a new tab)

  8. Structures and dynamics

    "Our results are divided in three independent chapters. In Chapter 2, we show that if g is a generic isometry of a generic subspace X of the Urysohn metric space U then g does not extend to a full isometry of U. The same applies to the Urysohn sphere S. Let M be a Fraisse L-structure, where L is a …

    uiuc Repository record for Structures and dynamics (opens in a new tab)