Samuel Coskey

Orcid: 0000-0002-7023-9725

According to our database1, Samuel Coskey authored at least 18 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Computable Reducibility of Equivalence Relations and an Effective jump operator.
J. Symb. Log., 2023

2022
New jump operators on equivalence relations.
J. Math. Log., 2022

2020
The classification of countable models of set theory.
Math. Log. Q., 2020

2019
On the classification of automorphisms of trees.
Contributions Discret. Math., 2019

Conjugacy for homogeneous ordered graphs.
Arch. Math. Log., 2019

On the classification of vertex-transitive structures.
Arch. Math. Log., 2019

The set splittability problem.
Australas. J Comb., 2019

2017
Cardinal characteristics and countable Borel equivalence relations.
Math. Log. Q., 2017

The conjugacy problem for automorphism groups of homogeneous digraphs.
Contributions Discret. Math., 2017

2016
The conjugacy problem for automorphism groups of countable homogeneous structures.
Math. Log. Q., 2016

On Generalizations of Separating and Splitting Families.
Electron. J. Comb., 2016

2015
G. A. Elliott, I. Farah, V. I. Paulsen, C. Rosendal, A. S. Toms, and A. Törnquist. The isomorphism relation for separable C*-algebras. Mathematics Research Letters, vol. 20 (2013), no. 6, pp. 1071-1080. - Marcin Sabok. Completeness of the isomorphism problem for separable C*-algebras. Inventiones Mathematicae, to appear, published online at link.springer.com/journal/222.
Bull. Symb. Log., 2015

2012
The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility.
Comput., 2012

2011
Infinite Time Decidable Equivalence Relation Theory.
Notre Dame J. Formal Log., 2011

The conjugacy problem for the automorphism group of the random graph.
Arch. Math. Log., 2011

2010
The complexity of classification problems for models of arithmetic.
Bull. Symb. Log., 2010

Borel reductions of profinite actions of SL<sub>n</sub>(Z).
Ann. Pure Appl. Log., 2010

2009
Infinite-Time Turing Machines and Borel Reducibility.
Proceedings of the Mathematical Theory and Computational Practice, 2009


  Loading...