I am interested in mathematical logic, specifically in model theory.
We introduce the notions of NIP and VC-dimension, and explore their relationship. Using a theorem about VC-dimension, one can derive an analogous result in the setting of pseudofinite structures under the NIP assumption. As a corollary of this in the group context, we obtain a qualitative result for the genericity of formulas with positive pseudofinite counting measure.
Fix an L-theory T and a formula. We will define what it means for a formula to be stable and explore equivalent reformulations, following Shelah’s Unstable Formula Theorem. In particular, we will study the connections between the cardinality of type spaces, n-ladders, n-trees, and the definability of types.
A short exposition of the Connes Embedding Problem and Continuous Logic. Reformulation of CEP in terms of computability is outlined.
An alternative proof of the Stable Graph Regularity Lemma, originally proved by M. Malliaris and S. Shelah. The alternative proof is outlined by C. Terry and J. Wolf.
A short exposition of Chapter 10 of the book The Probabilistic Method written by N. Alon and J. Spencer.
On Vaught's proof that Henkin's construction in the proof of the Completeness Theorem is effective: for a recursive language L, any consistent decidable L-theory has a recursive model.
On the shorter proof provided by Albin J. Jones of one of the partition theorems of P. Erdős and R. Rado.
May 2025. Las Cruces, New Mexico, US.
November 2024. Chicago, Illinois, US.
May 2024. Ames, Iowa, US.
April 2024. Notre Dame, Indiana, US.
June 2024. Budapest, Hungary.
October 2022. Chicago, Illinois, US.