11:30–12:20

Model theory and proof complexity

9:00–9:50

Notions of difference closures of difference fields

11:30–12:20

Logic and natural language: commitments and constraints

10:30–11:20

Well-ordering principles in proof theory and reverse mathematics

10:30–11:20

Well-ordering principles in proof theory and reverse mathematics

9:00–9:50

Local proof-theoretic foundations, proof-theoretic tameness and proof mining

11:30–12:20

Describing countable structures

9:00–9:50

The ultrafilter and almostdisjointness numbers

10:30–11:20

Logic of Computing with Continuous Data: Foundations of Numerical Software Engineering

11:30–12:20

Zero-one laws for provability logic and some of its siblings