Searcharxiv⌕ Search

arXiv subjects

Cameron Donnay Hill

Publications and source records attributed to Cameron Donnay Hill.

7 recordsLinked to original sources

On positive local combinatorial dividing-lines in model theory

We introduce the notion of positive local combinatorial dividing-lines in model theory. We show these are equivalently characterized by indecomposable algebraically trivial Fraisse classes and by complete prime filter classes. We exhibit the relationship between this and collapse-of-indiscernibles dividing-lines. We examine several test cases, including those arising from various classes of hypergraphs.

math.LO↗

Characterizing Model-Theoretic Dividing Lines via Collapse of Generalized Indiscernibles

We use the notion of collapse of generalized indiscernible sequences to classify various model theoretic dividing lines. In particular, we use collapse of n-multi-order indiscernibles to characterize op-dimension n; collapse of function-space indiscernibles (i.e. parameterized equivalence relations) to characterize rosy theories; and finally, convex equivalence relation indiscernibles to characterize NTP2 theories.

math.LO↗

On VC-density over indiscernible sequences

In this paper, we study VC-density over indiscernible sequences (denoted VC_ind-density). We answer an open question in [1], showing that VC_ind-density is always integer valued. We also show that VC_ind-density and dp-rank coincide in the natural way.

math.LO↗

On a common generalization of Shelah's 2-rank, dp-rank, and o-minimal dimension

In this paper, we build a dimension theory related to Shelah's 2-rank, dp-rank, and o-minimal dimension. We call this dimension op-dimension. We exhibit the notion of the n-multi-order property, generalizing the order property, and use this to create op-rank, which generalizes 2-rank. From this we build op-dimension. We show that op-dimension bounds dp-rank, that op-dimension is sub-additive, and op-dimension generalizes o-minimal dimension in o-minimal theories.

math.LO↗

The Geometry of L^k-Canonization I: Rosiness from Efficient Constructibility

We demonstrate that for the $k$-variable theory $T$ of a finite structure (satisfying certain amalgamation conditions), if finite models of $T$ can be recovered from diagrams of finite {\em subsets} of model of $T$ in a certain "efficient" way, then $T$ is rosy -- in fact, a certain natural $\aleph_0$-categorical completion $T^{\lim}$ of $T$ is super-rosy of finite $U^\thorn$-rank. In an appendix, we also show that any $k$-variable theory $T$ of a finite structure for which the Strong $L^k$-Canonization Problem is efficient soluble has the necessary amalgamation properties up to taking an appropriate reduct.

math.LO↗

On Weak Elimination of Hyperimaginaries and its Consequences

We analyze the notion of weak elimination of hyperimaginaries (WEHI) in simple theories. A key observation in the analysis is a characterization of WEHI in terms of forking dependence -- a condition we dub dependence-witnessed-by-imaginaries (DWIP). Generalizing results of [1] and [3], we show that in a simple theory with WEHI, forking and thorn-forking coincide. We also show that, conversely, the equivalence of independence and thorn-independence is (almost) sufficient for WEHI. Thus, the WEHI and the statement independence = thorn-independence are morally equivalent. As a further application of our technology, we demonstrate stable forking for 1-based theories of finite SU-rank that have WEHI.

math.LO↗

Generalized Indiscernibles as Model-complete Theories

We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special kinds of companionable theories of finite structures, and much of the work in our arguments is carried in the context of the model-companion. Among other things, this approach allows us to prove that the companion of a theory of indiscernibles whose "base" consists of the quantifier-free formulas is necessarily the theory of the Fraisse limit of a Fraisse class of linearly ordered finite structures (where the linear order will be at least quantifier-free definable). We also provide streamlined arguments for the result of [6] identifying extremely amenable groups with the automorphism groups of limits of Ramsey classes.

math.LO↗