32 citations · 105 across the 28 of their papers we have counts for
30 papers
A counterexample to Vaught's Conjecture for
Nathanael L. Ackerman, Cameron E. Freer, Robin W. Knight
We construct a sentence of having exactly many countable models up to isomorphism, but no perfect set of non-isomorphic models. This disproves Vaught's conje…
Forcing with Invariant Measures
Nathanael Ackerman, Cameron Freer, Mohammad Golshani +2
This paper introduces a model-theoretic generalization of the notion of forcing with random reals, in which forcing gives rise to random generic structures. Specifically, we consid…
On the computability of cofinal Fraïssé limits
Nathanael Ackerman, Cameron Freer, Mostafa Mirabi
For any collection of finite structures closed under isomorphism (i.e., an age) which has the Hereditary Property (HP), the Joint Embedding Property (JEP), and the Cofinal Amalgama…
Generic sampling and invariant measures on the space of -uniform hypergraphs
Nathanael Ackerman, Cameron Freer, Kyle Gannon +2
We prove a model-theoretic representation theorem for the distribution of an ergodic exchangeable -uniform hypergraph: every such measure arises as the pushforward of the counta…
Structured Sunflowers
Nathanael Ackerman, Mary Leah Karker, Mostafa Mirabi
We call an infinite structure sunflowerable if whenever is isomorphic to with underlying set , consisting of finite sets of bounded s…
Rainbow Threshold Graphs
Nathanael Ackerman, Mostafa Mirabi
We define a generalization of threshold graphs which we call -rainbow threshold graphs. We show that the collection of -rainbow threshold graphs do not satisfy the - la…