Program

The colloquium will run for five days and comprise 3 tutorials, 7 plenary lectures and 6 special sessions as well as contributed talks. In addition, the 2024 Gödel Lecture will be delivered at the meeting.

Tutorials

• Anuj Dawar, University of Cambridge: Model theory of tame classes of finite structures
• Alberto Marcone, Università Di Udine: WQOs and BQOs in logic
• Andrei Sipoș, University of Bucharest: An exploration of proof mining

Plenary Speakers

• Daisuke Bekki, Ochanomizu University: From Dependent Types to Natural Language Semantics
• Johanna Franklin, Hofstra University: Structural highness notions
• James Freitag, University of Illinois at Chicago: When any three solutions are independent
• Marianna Girlando, University of Amsterdam: A decision algorithm for intuitionistic S4
• Stephen Jackson, University of North Texas: Recent advances in the combinatorics of determinacy models
• Leszek Kołodziejczyk, University of Warsaw: Models of arithmetic that satisfy more collection than induction
• Paul-André Melliès, Université Paris Denis Diderot: Recent advances in higher-order automata and profinite lambda-calculus

Gödel Lecture

The 2024 Gödel lecture will be delivered by

• Thomas Scanlon, University of California at Berkeley

Special Sessions

Applied Model Theory, chairs: Gareth Jones and Tamara Servi

• Vincent Bagayoko, Université Paris Cité: Ordered groups of regular growth rates
• Anna Dmitrieva, University of East Anglia: Quasiminimality of complex functions
• Adele Padgett, McMaster University: O-minimal definitions of the complex Γ and Riemann ζ functions

Computable Structures, chairs: Uri Andrews and Julia Knight

• Meng-Che (Turbo) Ho, California State University: Decision problems for groups as equivalence relations
• Matthew Harrison-Trainor, University of Illinois
• David Gonzalez, University of California, Berkeley: Generically computable linear orderings

Logic, Language and Computation, chairs: Robin Cooper and Stergios Chatzikyriakidis

• Kristina Liefke, Ruhr-University, Bochum: Reduction and unification in (typed) natural language ontology
• Zhaohui Luo, Royal Holloway, University of London: Common nouns as types: Higher inductive types in type-theoretical semantics
• Peter Sutton, Universitat Pompeu Fabra, Barcelona

Logic in Philosophy, chairs: Volker Halbach and Heinrich Wansing

• Agata Ciabattoni, Technische Universität Wien
• Andrzej Indrzejczak, University of Łódź: Do theories of definite descriptions support Anselm’s God?
• Johannes Stern, University of Bristol: Truth, Conditionals, and Hyperintensionality

Proof Theory, chairs: Anton Freund and Sonia Marin

• Valentin Blot, ENS Paris-Saclay: Variants of bar recursion and their uses
• Lukas Melgaard, University of Birmingham: Cyclic versions of arithmetic theories with inductive definitions
• Takako Nemoto, Tohuku University, Computability theory over intuitionistic logic

Set Theory, chairs: Dana Bartošová and Slawomir Solecki

• Tamás Kátay, Eötvös Loránd University, Budapest: Generic properties of groups
• Claudio Agostini, Technische Universität Wien: The key properties of metrizability for (generalized) descriptive set theory
• Chris Lambie-Hanson, Czech Academy of Sciences

Contributed Talks

To be announced.