Samuel Coskey
Office: MB 238-B
(208) 426-2652
scoskey@boisestate.edu
About
Samuel joined the mathematics department in 2012. Previously he earned undergraduate degrees at the University of Washington and a PhD from Rutgers University. He held postdoctoral positions at the City University of New York, the Max Planck Institute, and the Fields Institute.
Samuel is primarily interested in set theory. Much of his work lies in Borel complexity theory, which is an area of descriptive set theory that aims to study the relative complexity of classification problems in mathematics. Additional interests include logic, model theory, computability theory, and combinatorics.
Set theory and logic at Boise State University
Selected products
- The set splittability problem. With Peter Bernstein, Cashous Bortner, Shuni Li, and Connor Simpson. Australasian journal of combinatorics, 2019
- On the classification of vertex-transitive structures. With John Clemens and Stephanie Potter. Archive for mathematical logic, 2019
- Conjugacy for homogeneous ordered graphs. With Paul Ellis. Archive for mathematical logic, 2019
- The conjugacy problem for automorphism groups of homogeneous digraphs. With Paul Ellis. Contributions to discrete mathematics, 2017
- On generalizations of separating and splitting families. With Daniel Condon, Luke Serafin, and Cody Stockdale. Electronic journal of combinatorics, 19pp, 2016
Selected courses taught
- Math 287 Communication in Mathematics
- Math 301 Linear Algebra
- Math 314 Foundations of Analysis
- Math 402/502 Logic and Set Theory
- Math 515 Real and Linear Analysis