Research Area: Mathematical Logic, Computable Structure Theory
Computable structure theory explores the computational properties of specific mathematical structures, such as groups. Although a subfield of computability theory, techniques are often borrowed from model theory (especially infinitary model theory) and algebra. Much of my research is motivated by Scott's Isomorphism Theorem, which states that if we extend first-order logic to allow countably infinite conjunctions and disjunctions, then every countable structure can be described up to isomorphism (among countable structures) by a single sentence known as a Scott sentence.
I also have a background (and current recreational interest) in philosophy of math and logic, esp. regarding Godel's incompleteness theorems.
Education:
- Ph.D (2022) University of Notre Dame
- B.A. (2015) St. John's College
My Ph.D thesis can be found here.
Some of my publications can be found on research gate.
A preprint of any of my papers can be obtained by emailing me.
My CV (as of Summer 2023) can be found here.
Some of my publications can be found on research gate.
A preprint of any of my papers can be obtained by emailing me.
My CV (as of Summer 2023) can be found here.