• 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
Video
–
Break
–
The Power of Two Variables

Howard Straubing, Boston College
Video
–
Towards Capturing Order-Independent P

Neil Immerman, University of Massachusetts 
Video
–
Lunch
–
New Results on Register Automata

Andrzej Murawski, University of Warwick
Video
–
Simulation and Bisimulations for Probabilistic Systems, and their Logical Contents

Nathanaël Fijalkow, University of Oxford
Video
–
Operations on Languages and Codensity Monads

Daniela Petrisan, Université Paris Diderot
Video
–
Break
–
Fibred Categories of Tree Automata

Colin Riba, ENS Lyon
Video
–
Pro-Aperiodic Monoids via Saturated Models

Sam Van Gool, City College of New York
Video
–
Reception
–
Coffee and Check-In
–
Lower Bounds for Subgraph Isomorphism and Consequences in First-Order Logic

Benjamin Rossman, University of Toronto
Video
–
Break
–
A Dichotomy Structure Theorem for the Resilience Problem

Cibele Freire, University of Massachusetts
Video
–
Symmetric Circuits and Fixed-Point Logics

Matthew Anderson, Union College
Video
–
Lunch
–
One Eilenberg Theorem to Rule Them All

Stefan Milius, Universität Erlangen-Nürnberg
Video
–
A Finite Alternation Result for Reversible Boolean Circuits

Peter Selinger, Dalhousie University
Video
–
Graph Isomorphism Via Non-Local Games

Simone Severini, University College London
Video
–
Break
–
Extending Symmetric Circuits

Gregory Wilsenach, University of Cambridge
Video
–
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps

Christoph Berkholz, Humboldt-Universität zu Berlin
Video
–
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
Video
–
Approximating Graph Isomorphism through Linear Maps

Anuj Dawar, University of Cambridge
Video
–
Lunch
–
Power and Limits of LP and SDP Relaxations

Stanislav Zivny, University of Oxford
Video
–
Reducts of Finitely Bounded Homogeneous Structures, and Lifting Tractability from Finite-Domain Constraint Satisfaction

Antoine Mottet, TU Dresden
Video
–
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
Video
–
Braid Groups, Hecke Algebras, Representations, and Anyons

Andreas Blass, University of Michigan
Video
–
Coffee and Check-In
–
Functional Programming Over Sets with Atoms

Bartek Klin, University of Warsaw
Video
–
Logic and Bisimulation for Guarded Teams

Erich Grädel, RWTH Aachen University
Video
–
Break
–
Logic in Computer Science, Engineering and Industry

Yuri Gurevich, Microsoft Research
Video
–
Symmetry-Preserving Finite Synthesis and Amalgamation

Martin Otto, Technische Universität Darmstadt
Video
–
Lunch
–
Logics of Finite Hankel Rank

Johann Makowsky, Technion Israel Institute of Technology
Video
–
The Logic of Counting Query Answers

Hubie Chen, Universidad del,
País,
Vasco
Video
–
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups

Prajakta Nimbhorkar, Chennai Mathematical Institute
Video
–
Break
–
Testing Assignments to Constraint Satisfaction Problems

Matt Valeriote, McMaster University
Video
–
The Expressiveness of Recognizability by Orbite Finite Nominal Monoids

Thomas,
Colcombet, IRIF
Video