2011
DOI: 10.2178/jsl/1305810758
|View full text |Cite
|
Sign up to set email alerts
|

On dp-minimal ordered structures

Abstract: We show basic facts about dp-minimal ordered structures. The main results are : dp-minimal groups are abelian-by-finite-exponent, in a divisible ordered dpminimal group, any infinite set has non-empty interior, and any theory of pure tree is dp-minimal.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
102
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 63 publications
(104 citation statements)
references
References 9 publications
2
102
0
Order By: Relevance
“…Proof. All we need to repeat the proof from [12] is to prove that all cosets of H contained in C are cofinal in C. So take any c ∈ C and fix h ∈ H. Choose h 1 ∈ H such that h 1 < c. Then, by the left-invariance of the order, h = (hh −1 1 )h 1 < hh −1 1 c ∈ Hc, so Hc is cofinal in C.…”
Section: Inp-minimal Left-ordered Groupsmentioning
confidence: 99%
See 2 more Smart Citations
“…Proof. All we need to repeat the proof from [12] is to prove that all cosets of H contained in C are cofinal in C. So take any c ∈ C and fix h ∈ H. Choose h 1 ∈ H such that h 1 < c. Then, by the left-invariance of the order, h = (hh −1 1 )h 1 < hh −1 1 c ∈ Hc, so Hc is cofinal in C.…”
Section: Inp-minimal Left-ordered Groupsmentioning
confidence: 99%
“…In this section, we prove that every inp-minimal left-ordered group is abelian. For a left-ordered group G and a subset A ⊆ G, by h(A) we will denote the convex hull of A in G. Note that (in contrast to the bi-ordered groups), in a left-ordered group G, the convex hull of a subgroup H need not be a subgroup of G: Nevertheless, in left-ordered groups, h(H) is always a union of right H-cosets, and, as an analogue of Lemma 3.2 from [12], we obtain: Fact 2.3. Let G be an inp-minimal left-ordered group.…”
Section: Inp-minimal Left-ordered Groupsmentioning
confidence: 99%
See 1 more Smart Citation
“…, P -minimal [HM97] or C-minimal [HM94], and more generally if it is a dp-minimal ordered or valued field [Sim11], [JSW17]. The same holds true if K is any Henselian (non-trivially) valued field of characteristic 0, or any algebraically bounded expansion of such [vdD89].…”
Section: (Bfin)mentioning
confidence: 99%
“…The final notion of rank discussed in the introduction is dp-rank, which we calculate for type-definable sets in the same way. In particular, if X is type-definable then dp(X) = sup{dp(p) : p |= X} where we set dp(p) to be the supremum over cardinals κ such that the relation "dp(p) ≥ κ" holds, as defined in [23,Chapter 4]. We are justified in avoiding the full definition of dp-rank because of the following fact about stable theories.…”
Section: Preliminariesmentioning
confidence: 99%