Searcharxiv⌕ Search

arXiv subjects

Samuel Coskey

Publications and source records attributed to Samuel Coskey.

26 records · Page 2Linked to original sources
arXiv2013

Borel Tukey morphisms and combinatorial cardinal invariants of the continuum

We discuss the Borel Tukey ordering on cardinal invariants of the continuum. We observe that this ordering makes sense for a larger class of cardinals than has previously been considered. We then provide a Borel version of a large portion of van Douwen's diagram. For instance, although the usual proof of the inequality $\mathfrak p\leq\mathfrak b$ does not provide a Borel Tukey map, we show that in fact there is one. Afterwards, we revisit a result of Mildenberger concerning a generalization of the unsplitting and splitting numbers. Lastly, we show that the inclusion ordering on $\mathcal P(ω)$ embeds into the Borel Tukey ordering on cardinal invariants.

math.LO↗
arXiv2012

The hierarchy of equivalence relations on the natural numbers under computable reducibility

The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with the Borel reducibility hierarchy from descriptive set theory. Meanwhile, the notion of computable reducibility appears well suited for an analysis of equivalence relations on the c.e.\ sets, and more specifically, on various classes of c.e.\ structures. This is a rich context with many natural examples, such as the isomorphism relation on c.e.\ graphs or on computably presented groups. Here, our exposition extends earlier work in the literature concerning the classification of computable structures. An abundance of open questions remains.

math.LO↗
arXiv2011

Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals

We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite time computable model theory. We focus particularly on the application of infinite time Turing machines to the analysis of the hierarchy of equivalence relations on the reals, in analogy with the theory arising from Borel reducibility. We define a notion of infinite time reducibility, which lifts much of the Borel theory into the class $\bmΔ^1_2$ in a satisfying way.

math.LO↗
arXiv2010

The complexity of classification problems for models of arithmetic

We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic are Borel; we investigate the precise complexity of each of these. Finally, we show that the classification problem for pairs of recursively saturated models and for automorphisms of a fixed recursively saturated model are Borel complete.

math.LO↗
arXiv2010

Borel reductions of profinite actions of SL(n,Z)

Greg Hjorth and Simon Thomas proved that the classification problem for torsion-free abelian groups of finite rank \emph{strictly increases} in complexity with the rank. Subsequently, Thomas proved that the complexity of the classification problems for $p$-local torsion-free abelian groups of fixed rank $n$ are \emph{pairwise incomparable} as $p$ varies. We prove that if $3\leq m<n$ and $p,q$ are distinct primes, then the complexity of the classification problem for $p$-local torsion-free abelian groups of rank $m$ is again incomparable with that for $q$-local torsion-free abelian groups of rank $n$.

math.LO↗
arXiv2009

Infinite time decidable equivalence relation theory

We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time computable functions. Many basic aspects of the classical theory remain intact, with the added bonus that it becomes sensible to study some special equivalence relations whose complexity is beyond Borel or even analytic. We also introduce an infinite time generalization of the countable Borel equivalence relations, a key subclass of the Borel equivalence relations, and again show that several key properties carry over to the larger class. Lastly, we collect together several results from the literature regarding Borel reducibility which apply also to absolutely Delta_1^2 reductions, and hence to the infinite time computable reductions.

math.LO↗