• Click on the titles of individual talks for abstract, slides and archived video.

–
Coffee and Check-In
–
Opening Remarks
–
Orbit-Finite Sets
Mikolaj Bojanczyk, University of Warsaw
–
Break
–
The Power of Two Variables
Howard Straubing, Boston College
–
Towards Capturing Order-Independent P
Neil Immerman, University of Massachusetts 
–
Lunch
–
New Results on Register Automata
Andrzej Murawski, University of Warwick
–
Simulation and Bisimulations for Probabilistic Systems, and their Logical Contents
Nathanaël Fijalkow, University of Oxford
–
Operations on Languages and Codensity Monads
Daniela Petrisan, Université Paris Diderot
–
Break
–
Fibred Categories of Tree Automata
Colin Riba, ENS Lyon
–
Pro-Aperiodic Monoids via Saturated Models
Sam Van Gool, City College of New York
–
Reception
–
Coffee and Check-In
–
Lower Bounds for Subgraph Isomorphism and Consequences in First-Order Logic
Benjamin Rossman, University of Toronto
–
Break
–
A Dichotomy Structure Theorem for the Resilience Problem
Cibele Freire, University of Massachusetts
–
Symmetric Circuits and Fixed-Point Logics
Matthew Anderson, Union College
–
Lunch
–
One Eilenberg Theorem to Rule Them All
Stefan Milius, Universität Erlangen-Nürnberg
–
A Finite Alternation Result for Reversible Boolean Circuits
Peter Selinger, Dalhousie University
–
Graph Isomorphism Via Non-Local Games
Simone Severini, University College London
–
Break
–
Extending Symmetric Circuits
Gregory Wilsenach, University of Cambridge
–
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
Christoph Berkholz, Humboldt-Universität zu Berlin
–
Coffee and Check-In
–
{Symmetry, Logic, Constraint Satisfaction Problem}
Libor Barto, Charles University
–
Break
–
Combinatorial Properties of the Weisfeiler-Leman Algorithm
Sandra Kiefer,, RWTH, Aachen
–
Approximating Graph Isomorphism through Linear Maps
Anuj Dawar, University of Cambridge
–
Lunch
–
Power and Limits of LP and SDP Relaxations
Stanislav Zivny, University of Oxford
–
Reducts of Finitely Bounded Homogeneous Structures, and Lifting Tractability from Finite-Domain Constraint Satisfaction
Antoine Mottet, TU Dresden
–
Finite Duality, Connectivity of Homomorphisms, Spatial Mixing and Gibbs Measures
Andrei Bulatov, Simon Fraser University
–
Break
–
FO-Definable Constraint Satisfaction Problems
Joanna Ochremiak, Universitat Politecnica de Catalunya
–
Braid Groups, Hecke Algebras, Representations, and Anyons
Andreas Blass, University of Michigan
–
Coffee and Check-In
–
Functional Programming Over Sets with Atoms
Bartek Klin, University of Warsaw
–
Logic and Bisimulation for Guarded Teams
Erich Grädel, RWTH Aachen University
–
Break
–
Logic in Computer Science, Engineering and Industry
Yuri Gurevich, Microsoft Research
–
Symmetry-Preserving Finite Synthesis and Amalgamation
Martin Otto, Technische Universität Darmstadt
–
Lunch
–
Logics of Finite Hankel Rank
Johann Makowsky, Technion Israel Institute of Technology
–
The Logic of Counting Query Answers
Hubie Chen, Universidad del, País, Vasco
–
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups
Prajakta Nimbhorkar, Chennai Mathematical Institute
–
Break
–
Testing Assignments to Constraint Satisfaction Problems
Matt Valeriote, McMaster University
–
The Expressiveness of Recognizability by Orbite Finite Nominal Monoids
Thomas, Colcombet, IRIF