Gareth Boxall

dblp:17/9133 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2023
0000-0003-0022-6256ORCID · corroborated

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

Theory of computation · 3 · 3 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.1
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.1
2012 Expansions which introduce no new open sets
abstract
Abstract We consider the question of when an expansion of a first-order topological structure has the property that every open set definable in the expansion is definable in the original structure. This question has been investigated by Dolich, Miller and Steinhorn in the setting of ordered structures as part of their work on the property of having o-minimal open core. We answer the question in a fairly general setting and provide conditions which in practice are often easy to check. We give a further characterisation in the special case of an expansion by a generic predicate.
Gareth Boxall, Philipp Hieromyni
J. Symb. Log.1