2019
DOI: 10.1017/jsl.2018.88
|View full text |Cite
|
Sign up to set email alerts
|

Strong Density of Definable Types and Closed Ordered Differential Fields

Abstract: The following strong form of density of definable types is introduced for theories T admitting a fibered dimension function d: given a model M of T and a definable set X ⊆ M n , there is a definable type p in X, definable over a code for X and of the same d-dimension as X. Both o-minimal theories and the theory of closed ordered differential fields (CODF) are shown to have this property. As an application, we derive a new proof of elimination of imaginaries for CODF.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…Moreover, K is endowed with a dimension function dim, associating to every set X definable with parameters some natural number, satisfying the axioms in [vdD89]. This function dim is invariant under automorphisms of the ambient structure: equivalently, dim is "codedefinable" in the sense of [BCKP19].…”
Section: Algebraically Boundedness and Dimensionmentioning
confidence: 99%
See 2 more Smart Citations
“…Moreover, K is endowed with a dimension function dim, associating to every set X definable with parameters some natural number, satisfying the axioms in [vdD89]. This function dim is invariant under automorphisms of the ambient structure: equivalently, dim is "codedefinable" in the sense of [BCKP19].…”
Section: Algebraically Boundedness and Dimensionmentioning
confidence: 99%
“…• RCF with m commuting generic derivations: see [FK20,CKP23] for a proof based on M. Tressl's idea, see also [BCKP19,Poi11] for different proofs; • DCF 0,m,nc (see [MS14]). We have seen that the above conjecture holds for certain topological structures (see §11).…”
Section: Conjectures and Open Problemsmentioning
confidence: 99%
See 1 more Smart Citation