Charlotte Kestner

dblp:68/10408 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0001-8976-2981ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2023 Theories with distal Shelah expansions
abstract
Abstract We show that a complete first-order theory T is distal provided it has a model M such that the theory of the Shelah expansion of M is distal.
Gareth Boxall, Charlotte Kestner
J. Symb. Log.2
2018 The Definable (P, Q)-Theorem for distal Theories
abstract
Abstract Answering a special case of a question of Chernikov and Simon, we show that any non-dividing formula over a model M in a distal NIP theory is a member of a consistent definable family, definable over M.
Gareth Boxall, Charlotte Kestner
J. Symb. Log.2
2011 Remarks on unimodularity
abstract
Abstract We clarify and correct some statements and results in the literature concerning unimodularity in the sense of Hrushovski [7], and measurability in the sense of Macpherson and Steinhorn [8], pointing out in particular that the two notions coincide for strongly minimal structures and that another property from [7] is strictly weaker, as well as “completing” Elwes' proof [5] that measurability implies 1-basedness for stable theories.
Charlotte Kestner, Anand Pillay
J. Symb. Log.1