13 citations · 40 across the 13 of their papers we have counts for
14 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…
On computable learning of continuous features
Nathanael Ackerman, Julian Asilis, Jieqi Di +2
We introduce definitions of computable PAC learning for binary classification over computable metric spaces. We provide sufficient conditions for learners that are empirical risk m…
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…