8 citations · 29 across the 22 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.LO2021★ 2 cited
On the complexity of the theory of a computably presented metric structure
Caleb Camrud, Isaac Goldbring, Timothy H. McNicholl
We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value o…
math.LO2021★ 1 cited
Effective notions of weak convergence of measures on the real line
Timothy H. McNicholl, Diego A. Rojas
We establish a framework for the study of the effective theory of weak convergence of measures. We define two effective notions of weak convergence of measures on : one…