13 citations · 40 across the 13 of their papers we have counts for
Showing 2018 · math.LOShow all
2 papers · 2 filters
math.LO2018★ 1 cited
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…
math.LO2018★ 4 cited
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…