Samuel Coskey earned his PhD from Rutgers University under the direction of Simon Thomas. His research interests include descriptive set theory, especially invariant descriptive set theory and its interactions with model theory, algebra, analysis, and computability theory.

# Recent and upcoming talks by Samuel Coskey

## Samuel Coskey: Classifying automorphisms of countable trees

Tuesday, September 13 from 3 to 4pm Room: MB 124 Speaker: Samuel Coskey (BSU) Title: Classifying automorphisms of countable trees Abstract: We summarize some of the results from Kyle Beserra’s master’s thesis. continue reading…

## Samuel Coskey: Amalgamation properties and conjugacy

Wednesday, September 2 from 3 to 4pm Room: MP 207 Speaker: Samuel Coskey (BSU) Title: Amalgamation properties and conjugacy Abstract: In this talk we aim to classify automorphisms of ultrahomogeneous structures up to conjugacy. continue reading…

## Samuel Coskey: López-Escobar’s theorem for metric structures

Wednesday, April 8 from 3 to 4pm Room: Math 124 Speaker: Samuel Coskey (BSU) Title: López-Escobar’s theorem for metric structures Abstract: The classical López-Escobar theorem states that any Borel class of countable structures may be axiomatized using an appropriate infinitary logic. continue reading…

## Samuel Coskey: Introduction to continuous logic

Wednesday, March 4 from 3 to 4pm Room: Math 124 Speaker: Samuel Coskey (BSU) Title: An introduction to continuous logic Abstract: Continous logic is a proper generalization of first order logic where the usual binary truth values are replaced by the unit interval $[0,1]$. continue reading…

## Samuel Coskey: Conjugacy and homogeneous graphs, II

Wednesday, February 4 from 3 to 4pm Room: Math 124 Speaker: Samuel Coskey (BSU) Title: Conjugacy and homogeneous graphs, II Abstract: This talk is continued from last semester. We study the conjugacy relation on the automorphism group of a homogeneous structure from the point of view of Borel complexity theory. continue reading…

## Samuel Coskey: Conjugacy and homogeneous graphs

Wednesday, September 3 from 3 to 4pm Room: Math 226 Speaker: Samuel Coskey (BSU) Title: Conjugacy and homogeneous graphs Abstract: Before studying the conjugacy problem in a given Polish group G, it is natural to ask what is the complexity of the conjugacy equivalence relation. continue reading…

## 21st Boise Extravaganza in Set Theory, June 18-20, 2014

BOISE EXTRAVAGANZA IN SET THEORY (BEST) June 18 – 20, 2014 University of California, Riverside The 21-st meeting of BEST will be hosted at University of California, Riverside, as a symposium of the 95th annual meeting of the American Association for the Advancement of Science – Pacific Division (AAAS-PD). continue reading…

## Samuel Coskey: A longer Choquet game

Tuesday, February 11 from 2 to 3pm Room: Mathematics 136 Speaker: Samuel Coskey (BSU) Title: A longer Choquet game Abstract: A topological space is Polish if it is separable and completely metrizable. continue reading…

## Samuel Coskey: Abelian groups and conjugacy

Monday, December 9 from 3 to 4pm Room: Mathematics 136 Speaker: Samuel Coskey (BSU) Title: Countable abelian groups and conjugacy relations Abstract: How hard is it to classify the countable abelian groups? continue reading…

## Samuel Coskey: Splitting relations

Monday, September 30 from 3 to 4pm Room: Mathematics 136 Speaker: Samuel Coskey (BSU) Title: Splitting relations Abstract: If $A$ and $B$ are infinite subsets of $\mathbb N$, we say that $A$ splits $B$ if both $A\cap B$ and $A^c\cap B$ are infinite. continue reading…