Schedule on ASL NA Meeting 2026

Model Theoretic Algebra

Sun, 14 Jun 2026 00:00:00 +0000

Part 1: Sunday, Silverman Hall S-240b.

Time	Speaker	Title
2:00 - 2:20	Blaise Boissoneau	cancelled
2:30 - 2:50	Matthias Stout	Formalizing the model theory of valued ﬁelds.
3:00 - 3:20	Scott Mutchnik	Classifying classiﬁcation-theoretic properties. (shifted early)
3:30 - 3:50	Ronan O’Gorman	Abstract group chunks. (shifted early)
4:00 - 4:20	Atticus Stonestrom	cancelled

Part 2: Monday, Silverman Hall S-245a.

Time	Speaker	Title
2:00 - 2:20	Christian d’Elbée	Lie methods for omega-categorical Engel groups.
2:30 - 2:50	Alexi Block Gorman	Characterizing geometries in automatic structures.
3:00 - 3:20	Nicolas Chavarria Gomez	Binding groups in continuous logic.
3:30 - 3:50	Yuyan He	Sum-product phenomenon via dimension.
4:00 - 4:20	Jananan Arulseelan	Continuous model-theoretic operator algebra.

Computability Theory

Mon, 01 Jan 0001 00:00:00 +0000

Part 1: Sunday, Silverman Hall S-240a.

Time	Speaker	Title
2:00 - 2:20	Jason Block	Computability for tree presentations of continuum-size structures.
2:30 - 2:50	Neil Lutz	Algorithmic information bounds for distances and orthogonal projections.
3:00 - 3:20	Peter Gerdes	Comparing notions of dense computability on $\omega^\omega$ and $2^\omega$.
3:30 - 3:50	David Gonzalez	Eﬀective aspects of the tree of tuples construction.
4:00 - 4:20	Valentina Harizanov	Complexity of exact and approximate isomorphisms.

Part 2: Monday, Silverman Hall S-240a.

Time	Speaker	Title
2:00 - 2:20	Meng-Che “Turbo” Ho	Scott analysis of the Farey graph.
2:30 - 2:50	Johanna Franklin	Highness for Scott rank.
3:00 - 3:20	Patrick Lutz	The Kučera-Gács Theorem and computable measures.
3:30 - 3:50	Mariya Soskova	Intuitionism and computing with partial information.
4:00 - 4:20	Heidi Benham	Problem reducibilities of topologically inspired order principles.

Contributed Talks

Mon, 01 Jan 0001 00:00:00 +0000

All contributed talks occur on the second floor of Silverman Hall.

Session I: Monday

Time	Speaker	Title	Location
4:30 - 4:50	William Adkisson	Strong Tree properties on segments of successors of singulars.	S-240a
4:30 - 4:50	Jeremy Beard	Limit models in strictly stable AECs.	S-240b
4:30 - 4:50	Yuxiao Fu	Weihrauch degrees of embeddability problems.	S-245a
5:00 - 5:20	Rishi Banerjee	Structurable equivalence relations and $L_{\omega_1,\omega}$ interpretations.	S-240a
5:00 - 5:20	Katie Ellman-Aspnes	Approximating $NSOP_1$ structures.	S-240b
5:00 - 5:20	Logan Heath	Uubs and suubs as theory spectra.	S-245a
5:30 - 5:50	Yiping Miao	Generic reals and gauge dimensions.	S-240a
5:30 - 5:50	James E. Hanson	Small large cardinals and neostability theory.	S-240b
5:30 - 5:50	Dhruv Kulshreshtha	A robust subclass of the nontotal continuous degrees.	S-245a

Session II: Tuesday

Time	Speaker	Title	Location
4:30 - 4:50	Robert S. Lubarsky	Harrington’s Principle in second-order arithmetic.	S-240a
4:30 - 4:50	Connor Lockhart	Pseudoﬁniteness of the Farey graph and random tesselations.	S-240b
4:30 - 4:50	Tyler Markkanen	Deciding the density of computable and c.e. sets.	S-245a
5:00 - 5:20	Robert S. Lubarsky	A possibly new proof of a possibly old theorem.	S-240a
5:00 - 5:20	Devrim Pekmezci	Local revised Ellis group conjecture.	S-240b
5:00 - 5:20	Karthik Ravishankar	Ahmad pairs and the local structure of the enumeration degrees.	S-245a
5:30 - 5:50	Morenikeji Neri	Extracting bounds from proofs involving ultraproducts.	S-240a
5:30 - 5:50	Jacob Stern	Divisible ordered abelian groups that are not weakly o-minimal.	S-240b
5:30 - 5:50	Joey Veltri	Eﬀective recurrence for computable measure-preserving transformations.	S-245a

Session III: Wednesday

Time	Speaker	Title	Location
4:30 - 4:50	Helena Rios	On Hilbert’s conception of mathematical objects.	S-240a
4:30 - 4:50	Yuki Takahashi	Dependent dividing and sub-additivity of burden.	S-240b
5:00 - 5:20	Brian Wynne	Existentially closed abelian lattice-ordered groups.	S-240b
5:30 - 5:50	Hongyu Zhu	A complete bounded theory with unbounded types.	S-240b

Logic in Computer Science

Mon, 01 Jan 0001 00:00:00 +0000

Part 1: Monday, Silverman Hall S-240b.

Time	Speaker	Title
2:00 - 2:20	Farzaneh Derakhshan	Mixed assurance reasoning via labeled bunches.
2:30 - 2:50	Robert Andrews	A survey of the Ideal Proof System.
3:00 - 3:20	Ilya Shapirovsky	On modal satisfiability problems in geometric spaces.
3:30 - 3:50	Henry Towsner	What proofs can be.
4:00 - 4:20	Phokion Kolaitis	On disjunctions of dependence atoms.

Part 2: Tuesday, Silverman Hall S-240a.

Time	Speaker	Title
2:00 - 2:20	Joanna Boyland	A proof-theoretic compilation from natural deduction to the semi-axiomatic sequent calculus.
2:30 - 2:50	Andre Scedrov	Complexity for product-free inﬁnitary action logic.
3:00 - 3:20	Carolyn Talcott	Diverse roles of logic based models.
3:30 - 3:50	Will Stafford	`Fine-style’ proof theoretic semantics for B.
4:00 - 4:20	Shay Logan	An epistemic probabilistic dynamic logic.

Proof Theory

Mon, 01 Jan 0001 00:00:00 +0000

Tuesday, Silverman Hall S-240b.

Time	Speaker	Title
2:00 - 2:20	Katalin Bimbó	Single cut rules.
2:30 - 2:50	Elijah Gadsby	On the slowing-down phenomenon.
3:00 - 3:20	Anton Freund	Fraïssé’s conjecture and partial impredicativity.
3:30 - 3:50	Andreas Weiermann	Some averaged zero one laws for segments of proof-theoretic ordinals.

Set Theory

Mon, 01 Jan 0001 00:00:00 +0000

Part 1: Sunday, Silverman Hall S-245a.

Time	Speaker	Title
2:00 - 2:20	Nathaniel Bannister	Condensed sets and the Solovay model.
2:30 - 2:50	James Cummings	Generating sets for ultraﬁlters.
3:00 - 3:20	Victoria Gitman	Reflection in set theory without powersets.
3:30 - 3:50	Siiri Kivimäki	Scott analysis for uncountable models and Aronszajn trees.
4:00 - 4:20	Fanxin Wu	One- and two-cardinal trees.

Part 2: Monday, Silverman Hall S-280.

Time	Speaker	Title
2:00 - 2:20	Filippo Calderoni	The space of finitely generated groups and classification problems.
2:30 - 2:50	Cecelia Higgins	Spectral theory for Borel pmp graphs.
3:00 - 3:20	Riley Thornton	Entropy and ultraproducts.
3:30 - 3:50	Allison Wang	Topological realizations of CBERs.

Tutorial: Computable Structure Theory and Infinitary Logic

Mon, 01 Jan 0001 00:00:00 +0000

Computable structure theory is an area of logic that applies techniques from computability theory to study countable mathematical structures such as graphs, linear orders, or groups. The goal is to understand and measure the complexity of working with these structures, including the complexity of describing a structure, of constructing a copy of a structure, of determining whether two structures are isomorphic, or of computing an isomorphism between two structures. This tutorial will introduce some of the central techniques and ideas of computable structure theory.