Program

The conference proceedings are available here.

CSL (Auditorium Maximum, Sala A)

Monday 13.02

08:55-09:00 Opening
09:00-10:00 Invited talk by Michał Pilipczuk on Structural graph theory through the lens of first-order logic
10:00-10:30 Coffee break
10:30-12:30 Session 1 on graphical calculi and categories:

  • 10:30-11:00 Paul Wilson, Dan Ghica and Fabio Zanasi on String diagrams for non-strict monoidal categories
  • 11:00-11:30 Luigi Santocanale and Cédric de Lacroix on Frobenius structures in star-autonomous categories
  • 11:30-12:00 Renaud Vilmart on Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Framents of Quantum Computation
  • 12:00-12:30 Mario Alvarez-Picallo, Dan Ghica, David Sprunger and Fabio Zanasi on Functorial String Diagrams for Reverse-Mode Automatic Differentiation

12:30-14:00 Lunch
14:00-15:00 Session 2 on databases:

  • 14:00-14:30 Ahmet Kara, Milos Nikolic, Dan Olteanu and Haozhe Zhang on Evaluation Trade-Offs for Acyclic Conjunctive Queries
  • 14:30-15:00 Felix Tschirbs, Nils Vortmeier and Thomas Zeume on Dynamic Complexity of Regular Languages: Big changes, small work

15:00-15:30 Coffee break
15:30-17:30 Session 3 on coalgebra:

  • 15:30-16:00 Harsh Beohar, Sebastian Gurke, Barbara König and Karla Messing on Hennessy-Milner Theorems via Galois Connections
  • 16:00-16:30 Thorsten Wißmann on Supported Sets – A New Foundation For Nominal Sets And Automata
  • 16:30-17:00 Corina Cirstea and Clemens Kupke on Measure-Theoretic Semantics for Quantitative Parity Automata
  • 17:00-17:30 Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder and Paul Wild on Quantitative Hennessy-Milner Theorems via Notions of Density

18:00-22:00 Reception

Tuesday 14.02

09:00-10:00 Invited talk by Claudia Faggian on Asymptotic Rewriting
10:00-10:30 Coffee break
10:30-12:30 Session 4 on lambda-calculus:

  • 10:30-11:00 Chris Barrett, Willem Heijltjes and Guy McCusker on The Functional Machine Calculus II: Semantics
  • 11:00-11:30 Pablo Barenbaum and Teodoro Freund on Proofs and Refutations for Intuitionistic and Second-Order Logic
  • 11:30-12:00 Pablo Barenbaum and Eduardo Bonelli on Reductions in Higher-Order Rewriting and Their Equivalence
  • 12:00-12:30 Ugo Dal Lago, Francesco Gavazzo and Alexis Ghyselen on Open Higher-Order Logic

12:30-14:00 Lunch
14:00-15:00 Invited talk by Mikołaj Bojańczyk on The category of MSO transductions
15:00-15:30 Coffee break
15:30-17:30 Session 5 on type theory:

  • 15:30-16:00 Thiago Felicissimo, Frédéric Blanqui and Ashish Kumar Barnawal on Translating proofs from an impredicative type system to a predicative one
  • 16:00-16:30 Yannick Forster and Felix Jahn on Constructive and Synthetic Reducibility Degrees: Post’s Problem for Many-one and Truth-table Reducibility in Coq
  • 16:30-17:00 Kostia Chardonnet, Alexis Saurin and Benoît Valiron on A Curry-Howard Correspondence for Linear, Reversible Computation
  • 17:00-17:30 Liron Cohen and Vincent Rahli on Realizing Continuity Using Stateful Computations
Wednesday 15.02

09:00-10:00 Invited talk by Dale Miller on A Positive Perspective on Term Representation
10:00-10:30 Coffee break
10:30-12:30 Session 6 on finite model theory & counting:

  • 10:30-11:00 Benedikt Pago on Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus 
  • 11:00-11:30 Lauri Hella on The expressive power of CSP-quantifiers
  • 11:30-12:00 Julien Grange on Order-Invariance in the Two-Variable Fragment of First-Order Logic
  • 12:00-12:30 Bart Jacobs and Dario Stein on Counting and Matching

12:30-14:00 Lunch
14:00-15:00 Session 7 on proof theory:

  • 14:00-14:30 Gianluca Curzi and Anupam Das on Non-uniform complexity via non-wellfounded proofs
  • 14:30-15:00 Bahareh Afshari, Graham Leigh and Guillermo Menéndez Turata on A Cyclic Proof System for Full Computation Tree Logic

15:00-15:30 Coffee break
15:30-16:00 Rasiowa award: Hiromi Tanaka on Tower-Complete Problems in Contraction-Free Substructural Logics
16:00-17:00 Ackermann award.
17:00-18:30 Business meeting.

20:00-24:00 CSL banquet.

Thursday 16.02

9:00-10:00 Invited talk by Nina Gierasimczuk on Inductive Inference and Epistemic Modal Logic
10:00-10:30 Coffee break
10:30-12:30 Session 8 on games & automata:

  • 10:30-11:00 Émile Hazard and Denis Kuperberg on Explorable Automata
  • 11:00-11:30 Konrad Staniszewski on Parity Games of Bounded Tree-Depth
  • 11:30-12:00 Dana Fisman, Joshua Grogin and Gera Weiss on A Normalized Edit Distance on Infinite Words
  • 12:00-12:30 Paolo Baldan, Richard Eggert, Barbara König and Tommaso Padoan on A Lattice-Theoretical View of Strategy Iteration

12:30-14:00 Lunch
14:00-15:00 Session 9 on computability:

  • 14:00-14:30 Dominik Kirst and Benjamin Peters on Gödel’s Theorem Without Tears: Essential Incompleteness in Synthetic Computability
  • 14:30-15:00 Nikolay Bazhenov and Dariusz Kalociński on Degree spectra, and relative acceptability of notations

15:00-15:30 Coffee break
15:30-17:00 Session 10 on complexity:

  • 15:30-16:00 Reijo Jaakkola and Antti Kuusisto on Complexity classifications via algebraic logic
  • 16:00-16:30 Reijo Jaakkola on Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability
  • 16:30-17:00 Ian Pratt-Hartmann and Lidia Tendera on Adding Transitivity and Counting to the Fluted Fragment

Workshops

Friday 17.02
Get in Touch