4 citations · 5 across the 4 of their papers we have counts for
6 papers
On computable aspects of algebraic and definable closure
Nathanael Ackerman, Cameron Freer, Rehana Patel
We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quanti…
Fraisse classes with simply characterized big Ramsey degrees
Rebecca Coulson, Natasha Dobrinen, Rehana Patel
We formulate a property strengthening the Disjoint Amalgamation Property and prove that every Fraisse structure in a finite relational language with relation symbols of arity at mo…
The entropy function of an invariant measure
Nathanael Ackerman, Cameron Freer, Rehana Patel
Given a countable relational language , we consider probability measures on the space of -structures with underlying set that are invariant under the logic actio…
Stable regularity for relational structures
Nathanael Ackerman, Cameron Freer, Rehana Patel
We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that unde…
Properly ergodic structures
Nathanael Ackerman, Cameron Freer, Alex Kruckman +1
We consider ergodic -invariant probability measures on the space of -structures with domain (for a countable relational language), and…
Countable infinitary theories admitting an invariant measure
Nathanael Ackerman, Cameron Freer, Rehana Patel
Let be a countable language. We characterize, in terms of definable closure, those countable theories of for which there exists an -inva…