Papers
Topics
Authors
Recent
Search
2000 character limit reached

Neostability in countable homogeneous metric spaces

Published 9 Apr 2015 in math.LO | (1504.02427v4)

Abstract: Given a countable, totally ordered commutative monoid $\mathcal{R}=(R,\oplus,\leq,0)$, with least element $0$, there is a countable, universal and ultrahomogeneous metric space $\mathcal{U}\mathcal{R}$ with distances in $\mathcal{R}$. We refer to this space as the $\mathcal{R}$-Urysohn space, and consider the theory of $\mathcal{U}\mathcal{R}$ in a binary relational language of distance inequalities. This setting encompasses many classical structures of varying model theoretic complexity, including the rational Urysohn space, the free $n{\text{th}}$ roots of the complete graph (e.g. the random graph when $n=2$), and theories of refining equivalence relations (viewed as ultrametric spaces). We characterize model theoretic properties of $\text{Th}(\mathcal{U}_\mathcal{R})$ by algebraic properties of $\mathcal{R}$, many of which are first-order in the language of ordered monoids. This includes stability, simplicity, and Shelah's SOP$_n$-hierarchy. Using the submonoid of idempotents in $\mathcal{R}$, we also characterize superstability, supersimplicity, and weak elimination of imaginaries. Finally, we give necessary conditions for elimination of hyperimaginaries, which further develops previous work of Casanovas and Wagner.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.