Samuel Coskey joined the faculty of the Department of Mathematics at Boise State University in 2012. Originally from Seattle, he has two bachelor's degrees, in Mathematics and Computer Science, from the University of Washington, and a Ph.D. in Mathematics from Rutgers, The State University of New Jersey. Before coming to Boise State he served as a postdoc at the Graduate Center at the City University of New York, and did research at the Max Planck Institute for Mathematics in Germany, where he collaborated with the logic group at the University of Bonn. Dr. Coskey's dissertation research was in countable Borel equivalence relations; specifically the classification problem for torsion-free abelian groups of finite rank. He has since studied some aspects of the structure of the Borel equivalence relations as a whole, and his recent research interests include a variety of questions involving classification problems from other areas of math and logic, including algebra, model theory, analysis, infinitary logic, and computability theory.
Articles
The Classification of Torsion-free Abelian Groups of Finite Rank Up to Isomorphism and Up to Quasi-isomorphism, Transactions of the American Mathematical Society (2012)
The isomorphism and quasi-isomorphism relations on the p-local torsion-free abelian groups of rank n ≥...
The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility (with Joel David Hamkins and Russell Miller), Computability (2012)
The notion of computable reducibility between equivalence relations on the natural numbers provides a natural...
Infinite Time Decidable Equivalence Relation Theory (with Joel David Hamkins), Notre Dame Journal of Formal Logic (2011)
We introduce an analogue of the theory of Borel equivalence relations in which we study...
The Conjugacy Problem for the Automorphism Group of the Random Graph (with Paul Ellis and Scott Schneider), Archive for Mathematical Logic (2011)
We prove that the conjugacy problem for the automorphism group of the random graph is...
The Complexity of Classification Problems for Models of Arithmetic (with Roman Kossak), The Bulletin of Symbolic Logic (2010)
We observe that the classification problem for countable models of arithmetic is Borel complete. On...
Presentations
Cardinal Invariants and the Borel Tukey Order, Canadian Mathematical Society Winter Meeting (2011)
Many proofs of inequalities between cardinal characteristics of the continuum are combinatorial in nature. These...
Infinite-time Turing Machines and Borel Reducibility, Computability in Europe (2009)
In this document I will outline a couple of recent developments, due to Joel Hamkins,...