Computability, Structure Theory

📍 Lecture Room 003

• (11:40) Russell Miller: Computable elements within tree-presented structures
• (12:00) Gabriele Buriola: Well-ordering principles over recursive comprehension
• (12:20) Davide Manca: Better-quasi-ordering sequences with the gap condition

Model Theory

📍 Board Room (401)

• (11:40) Masato Fujita: Connected components of sets definable in d-minimal expansion of the real field
• (12:00) Galina Kaleeva: Universal equivalence of linear groups over rings
• (12:20) André Rognes: On generalisations of a representation of the integers modulo p, for the purpose of occasionally establishing the unsolvability of diophantine inequalities

Philosophical Logic

📍 Robert Recorde (102)

• (11:40) Gabriele Pulcini: Relative contingency
• (12:00) J. Albert Yoo: Non-composability of realised epistemic access: a type-theoretic account of temporal integration via parametricity
• (12:20) Konstantinos Papafilippou: Categoricity-like properties applied to some 'friends' of Kf𝜇

Proof Theory

📍 Lecture Room 002

• (11:40) Andreas Weiermann: Some averaged zero one laws for segments of proof-theoretic ordinals
• (12:00) Dimitrios Tsintsilidas: Separation of induction and collection axiom in bounded arithmetic with student-teacher games
• (12:20) Nox Cowie: Double negation elimination and the multiple succedent structure of LK

History of Logic and Computing

📍 Robert Recorde (102)

Organiser(s): Troy Astarte (Swansea)

• (15:45) Giuseppe Primiero: On verifying computational systems
• (16:25) Mathilde Fichen: Anatomy of a Programming Language: Prolog and the Beginnings of European Artificial Intelligence Research
• (17:15) John Tucker: Writing the history of Logic and Computing

Computability in Analysis

📍 Lecture Room 002

Organiser(s): Daniel Graça (Faro) and Arno Pauly (Swansea)

• (15:45) Manon Blanc: Complexity in computable analysis: the notions of costs for analogue models
• (16:25) Holger Thies: Extracting certified programs from type-theoretic proofs in analysis and topology
• (17:15) Matea Čelar: Computable subcontinua and effective decomposability of arcs and arc-like continua

Reverse Maths/Computability

📍 Lecture Room 003

• (11:40) Paul Shafer: Bounded Ramsey's theorem for triples in computability theory
• (12:00) Mengzhou Sun: The cohesive and stable Ramsey theorems and proof size over a weak base theory
• (12:20) Gian Marco Osso: The Laver partition theorem for open sets: the nucleus of Ramsey property and determinacy?

Model Theory

📍 Board Room (401)

• (11:40) Jeremy Beard: Limit models in strictly stable AECs
• (12:00) Nazerke Mussina, Indira Tungushbayeva, Aibat Yeshkeyev: The hybrids of holographic Jonsson theories and their Jonsson spectrum
• (12:20) Indira Tungushbayeva: On the number of Kaiser-normal classes in a fixed Jonsson spectrum

Philosophical Logic

📍 Robert Recorde (102)

• (11:40) Rodrigo Mena González: Two logics for normative announcements
• (12:00) Charles Walzer: A labelled sequent calculus for truthmaker semantics
• (12:20) Ragna Oeynhausen: A truthmaker semantics for positive free logic

Proof Theory

📍 Lecture Room 002

• (11:40) Alexander V. Gheorghiu: Truth, support, and arithmetic
• (12:00) Joachim Mueller-Theys: On the possibility of logical constructivism
• (12:20) Hsing-Chien Tsai: Atomicity and identity in nontransitive mereology

Set Theory

📍 Reading Room

• (11:40) Alvaro Diaz Ramos: Generalized Sums of Linear Orders
• (12:00) Paul Blain Levy: Broad Infinity implies Mahlo assuming Choice: a direct proof
• (12:20) Guohua Wu: On a subclass of Baire Class α functions

Computability

📍 Lecture Room 003

• (15:45) Stella Spadoni: On decidability and bounded proofs in fragments of computability logic
• (16:05) Cosimo Perini Brogi: On protocol security via computability logic
• (16:25) Giorgio Genovesi: The tree interpretation and transfinite recursion

Model Theory

📍 Board Room (401)

• (15:45) Aizhan Altayeva: On algebras of binary formulas in circularly ordered structures: piecewise monotonic case
• (16:05) Mirko Engler: Semantic determinacy and self-interpretations of theories
• (16:25) Nesta van der Schaaf: Localic Esakia duality

Philosophy of Mathematics/History

📍 Robert Recorde (102)

• (15:45) Daniel Isaacson: Dedekind's axiomatisation of arithmetic as a case of informal rigour
• (16:05) Karol Wapniarski: Leibniz and Russell: on the birth of analytic philosophy
• (16:25) Rezan Burcu Büyükikiz: An introduction to Husserl's phenomenology: on the nature of numbers

Proof Mining

📍 Lecture Room 002

• (15:45) Andrei Sipos: A worked example in proof mining in uniformly convex Banach spaces
• (16:05) Morenikeji Neri: Extracting bounds from proofs involving ultraproducts
• (16:25) Horatiu Cheval: General metatheorems in proof mining

Intuitionistic Set Theory/Philosophy

📍 Reading Room

• (15:45) Shuwei Wang: Indexed hierarchies and internal structure in the ordinal class in intuitionistic set theories
• (16:05) Patrick Uftring: Intuitionistic Set Theory
• (16:25) Simone Picenni: Conceptions of sets and classes in a class theory with a universal set

Set Theory

📍 Robert Recorde (102)

Organiser(s): Boban Velickovic (Paris) and Matteo Viale (Turin)

• (10:45) Alejandro Poveda: The directedness of the Rudin--Keisler order on measurable cardinals
• (11:25) Sumun Iyer: The Knaster continuum homeomorphism group
• (15:20) Borisa Kuzeljevic: A dichotomy for transitive lists

Type Theory

📍 Lecture Room 002

Organiser(s): Fredrik Nordvall Forsberg (Strathclyde) and Nicolai Kraus (Nottingham)

• (10:45) Loïc Pujet: Revisiting Hofmann's setoid model
• (11:25) Zhixuan Yang: Functional Data Structures in Monoidal Categories
• (12:05) TBA: TBA

Pure and Applied Proof Theory

📍 Lecture Room 002

Organiser(s): Raheleh Jalali (Bath) and Andrei Sipos (Bucharest)

• (15:45) Pavel Pudlak: On the complexity of the Herbrand theorem
• (16:25) Lev Beklemishev: Automatic structures and the problem of natural well-orderings
• (17:15) Paulo Firmino: Quantitative results on a generalized viscosity approximation method

Model Theory

📍 Robert Recorde (102)

Organiser(s): Pantelis Eleftheriou (Leeds) and Frank Wagner (Lyon)

• (15:45) Anna de Mase: Automatic definability of valuations from an order-topological perspective
• (16:25) Mark Kamsma (Masaryk): Cofibrant generation of pure monomorphisms in presheaf categories
• (17:15) Stefan Ludwig: Generalisations of Ax's theorem on pseudofinite fields

Provability Logic

📍 Lecture Room 003

• (11:40) Giovanni Soldà: Towards infinitary GL
• (12:00) Felix Frigola Gonzalez: On the Goldblatt-Thomason theorem for interpretability logic
• (12:20) Elise Perrotin: The logic behind Hanabi

Type Theory

📍 Board Room (401)

• (11:40) Aref Mohammadzadeh: Generalized decidability via Brouwer ordinals
• (12:00) Pablo Donato: Towards a Curry-Howard correspondence for existential graphs
• (12:20) Harry Bryant: Certified assurance for railway interlockings: from SAT proofs to mechanised verification in Rocq and Agda

Philosophy of Mathematics/Finitism

📍 Robert Recorde (102)

• (11:40) Alessandro Giglia: Against the equivalence of potentialist and actualist set theories
• (12:00) Matthias Eberl: Formalizing indefinite extensibility
• (12:20) Aleksi Honkasalo: Modal alternative set theory

Proof Mining

📍 Lecture Room 002

• (11:40) Thomas Powell: On the structure of convergence proofs in stochastic optimization
• (12:00) Pedro Pinto: A finitistic perspective on convergence results
• (12:20) Laurentiu Leustean: Effective methods: logic and optimization

Set Theory

📍 Reading Room

• (11:40) Yiping Miao: Generic reals and gauge dimensions
• (12:00) James E. Hanson: Small large cardinals and neostability theory

Reverse Maths/Computability

📍 Lecture Room 003

• (14:15) Ian Price: Strong reductions are adaptors
• (14:35) Mihai Prunescu: Closed formulas for arbitrary Kalmar elementary functions
• (14:55) Benjamin Koch: On the computational strength of Hausdorff oracles
• (15:15) Eike Neumann: On the complexity of quadratic iteration

Philosophy of Mathematics

📍 Robert Recorde

• (14:15) David Appadourai: Localising overgeneration: a three-strata decomposition of formal proof
• (14:35) S. Kaan Tabakci: Model-theoretic inferentialism: the best of both worlds
• (14:55) Stan Srednyak: Theory of higher differentiable functionals and applications
• (15:15) Ramazan Ayupov: Analyticity and contemporary formal theories: Hintikka's typology and the case of type theory

Proof Theory

📍 Lecture Room 002

• (14:15) Anton Setzer: Bachmann-Howard from below
• (14:35) Elio La Rosa: Skolemization and Herbrand's Theorem for intermediate logics over predicate abstraction
• (14:55) Alakh Dhruv Chopra: Well-founded trees with leaf labels, and their applications