Preliminary Schedule (day-by-day printable pdf)
Morning | |||||
8:30–9:00 | Registration. SH 110 | ||||
9:00–10:00 | Opening remarks, followed by Invited Lecture: Maryanthe Malliaris (University of Chicago). New perspectives on model-theoretic complexity. SH 102 | ||||
10:00–10:20 | Coffee. SH 110 | ||||
10:30–11:20 | Tutorial Lecture: Mariya I. Soskova (University of Wisconsin). Enumeration reducibility and effective mathematics, part 1. SH 102 | ||||
11:30–12:20 | Invited Lecture: Patrick Lutz (UC Berkeley). Measure hyperfiniteness and lossless expansion. SH 102 | ||||
Afternoon | |||||
ST1: SH 107 | CT1: SH 106 | MT1: SH 108 | ML1: SH 115 | ||
2:00–2:30 | Natasha Dobrinen Ramsey spaces and their ultrafilters. |
2:00–2:20 | Julia Knight Computable Π2 Scott sentences. |
Aaron Anderson Examples of distal metric structures. |
Joel Lucero-Bryan On modal logics arising from the Čech-Stone compactification of ordinals. |
2:40–3:10 | Anton Bernshteyn Borel Local Lemma for graphs of slow growth. |
2:30–2:50 | Diego Bejarano Definability and Scott rank in separable metric structures. |
Vladislav Sliusarev Criteria of local tabularity of products of modal logics. |
|
3:20–3:50 | Filippo Calderoni Idealistic equivalence relations remastered. |
3:00–3:20 | Keshav Srinivasan Effective ultrapowers of algebraic extensions of ℚ. |
David Meretzky Differential Galois theory with new algebraic constants. |
[cancelled] |
3:30–3:50 | Andrew DeLapo Computability and countable second-countable spaces. |
[cancelled] Fedor Pakhomov The logic of correct models. |
|||
4:00–4:20 | Coffee. SH 110 | ||||
4:30–5:20 | Sergei Artemov (Graduate Center CUNY). Consistency of PA is a serial property, and it is provable in PA. SH 102 | ||||
6:00–9:00 | Welcoming Reception at the Courtyard by Marriott |
Morning | ||||||
8:30–9:00 | Registration. SH 110 | |||||
9:00–9:50 | Tutorial Lecture: Julia Wolf (University of Cambridge). An introduction to higher-order stability, part 1. SH 102 | |||||
10:00–10:20 | Registration and coffee. SH 110 | |||||
10:30–11:20 | Tutorial Lecture: Mariya I. Soskova (University of Wisconsin). Enumeration reducibility and effective mathematics, part 2. SH 102 | |||||
11:30–12:20 | Invited Lecture: Benjamin Castle (University of Illinois). Reconstruction problems in geometry via model theory. SH 102 | |||||
Afternoon | ||||||
ST2: SH 107 | MT2: SH 108 | CL1: SH 109 | CT2: SH 106 | ML2: SH 115 | ||
2:00–2:30 | James Cummings Linear orderings and singular cardinal combinatorics. |
Michael C. Laskowski Equivalents of NOTOP. |
Saugata Basu Cohomological VC-density: bounds and applications. |
2:00–2:20 | Reed Solomon Strong indivisibility for graphs. |
Andrew Bacon What is the logic of logical necessity? |
2:40–3:10 | Ruiyuan Chen Topology versus Borel structure for actions, equivalence relations, and groupoids. |
Christine Eagles A uniqueness condition for composition analyses. |
Chris Conidis The computability of the uniform Krull intersection theorem. |
2:30–2:50 | Ahmee Christensen First-order Fischer Servi logic. |
|
3:00–3:20 | Steffen Lempp Chains and antichains in the Weihrauch lattice. |
[cancelled] Joseph McDonald Monadic ortholattices: completions and duality. |
||||
3:20–3:50 | Maxwell Levine Namba forcing and singular cardinals. |
Michele Bailetti A walk on the wild side. |
Cecelia Higgins Complexity of finite Borel asymptotic dimension. |
3:30–3:50 | Ang Li Countable ordered groups and Weihrauch reducibility. |
Eric Pacuit Common p-belief and plausibility measures. |
4:00–4:20 | Coffee. SH 110 | |||
SH 106 | SH 107 | SH 108 | SH 109 | |
4:30–4:50 | Jackson West Farness logics of Euclidean spaces. |
Sapir Ben-Shahar On Quasi-reducibility for c.e. sets. |
Morgan Bryant Merges of smooth classes and their properties. |
Tan Ozalp Initial Tukey structure below a stable ordered-union ultrafilter. |
5:00–5:20 | Elijah Gadsby Properties of selector proofs. |
Bjørn Kjos-Hanssen The Shannon effect. |
Connor Lockhart Model theory of the Farey graph via smooth classes. |
Hongyu Zhu The Borel complexity of the class of models of first-order theories. |
5:30–5:50 | Arzhang Kamarei Using paradoxical conditionals to reify and imply a semantic fixed point for Godel’s G in first order arithmetic. |
Ronald Fuller A new kind of information. |
Robert S. Lubarsky On strategies for player II in Σ20 games. |
Morning | ||||||
8:30–9:00 | Registration. SH 236 | |||||
9:00–9:50 | Tutorial Lecture: Julia Wolf (University of Cambridge). An introduction to higher-order stability, part 2. SH 102 | |||||
10:00–10:20 | Coffee. SH 110 | |||||
10:30–11:20 | Tutorial Lecture: Mariya I. Soskova (University of Wisconsin). Enumeration reducibility and effective mathematics, part 3. SH 102 | |||||
11:30–12:20 | Invited Lecture: Alejandro Poveda (Harvard University). Recent developments on the theory of supercompact cardinals. SH 102 | |||||
Afternoon | ||||||
PA1: SH 115 | ||||||
12:40–1:20 | Egbert Rijke Mathematical structures from a univalent point of view. |
|||||
1:30–1:45 | Patricia Johann Deep induction for advanced data types. |
|||||
CT3: SH 106 | MT3: SH 108 | CL2: SH 109 | ||||
2:00–2:50 | Alexander Melnikov The space of continuous functions: a playground for logic. |
Lynn Scow The modeling property. |
2:00–2:30 | David Gonzalez Ramsey theoretic statements motivated by generic computability. |
1:55–2:10 | Talitha Holcombe A common abstract syntax for total functional programming and interactive theorem provers. |
2:40–3:10 | Sam Murray Borel fractional perfect matchings in quasi-transitive amenable graphs. |
2:20–3:00 | Michael Shulman An observational proof assistant for higher-dimensional mathematics. |
|||
3:00–3:20 | Java Darleen Villano Computable categoricity relative to a generic degree. |
Léo Jimenez Internality of autonomous systems of differential equations. |
3:10–3:25 | Wojciech Nawrocki Compiling homotopy type theory with Lean: syntax and interpretation. |
||
3:30–3:50 | Jacob Fiedler Extending affine subspaces in higher dimensions. |
Aris Papadopoulos Mekler’s construction and Murphy’s law for 2-nilpotent groups. |
3:20–3:50 | Rehana Patel Countable infinitary theories admitting an invariant measure. |
3:30–3:45 | Spencer Woolfson Compiling homotopy type theory with Lean: the groupoid model of HoTT0. |
3:55–4:10 | Aeacus Sheng Formally verifying automata for trusted decision procedures. |
|||||
4:10–4:20 | Coffee. SH 110 | |||||
4:30–5:20 | Invited Lecture: Felix Weilacher (UC Berkeley). Separating complexity classes of LCL problems on grids. SH 102 | |||||
6:30–8:30 | Informal gathering at The Game |
Morning | ||||||
8:30–9:00 | Registration. SH 236 | |||||
9:00–9:50 | Tutorial Lecture: Julia Wolf (University of Cambridge). An introduction to higher-order stability, part 3. SH 102 | |||||
10:00–10:20 | Coffee. SH 110 | |||||
CL3: SH 109 | PA2: SH 108 | ST3: SH 106 | ML3: SH 115 | |||
10:30–11:00 | Theodore A. Slaman Cauchy subsequences and the cohesiveness principle. |
10:30–11:10 | Leonardo de Moura Verified collaboration: low Lean is transforming mathematics, programming, and AI. |
10:30–10:50 | Riley Thornton Measurable nibbling and hypergraph limits. |
Konstantinos Papafilippou Parametric unification: when projectivity meets uniform post-interpolants. |
11:10–11:40 | Atticus Stonestrom An arithmetic algebraic regularity lemma. |
11:20–12:00 | Emily Riehl Prospects for formalizing the theory of weak infinite-dimensional categories. |
11:00–11:20 | William Adkisson Tree properties at successors of singulars of many different cofinalities. |
Alexandru Baltag The topology of surprise. |
11:50–12:20 | Andy Zucker Enumerations of Boolean algebras. |
12:05–12:20 | Peter Jipsen Representability and formalization of relation algebras. |
11:30–11:50 | Jenna Zomback Asymptotically spherical groups. |
Sonja Smets Reasoning about quantum information: the probabilistic logic of quantum programs. |
12:00–12:20 | Eyal Kaplan Failure of GCH on a measurable with the Ultrapower Axiom. |