Prague Workshop on Bounded Arithmetic

When and where



Note that talks are 55 or 25 minute long. See abstracts
Thursday, November 2nd
09:00 Coffee
09:20 Opening
09:30 Sam Buss: Expander construction in VNC_1
10:30 Coffee
11:00 Andres Cordon Franco: Local variants of the induction principle: an overview
12:00 Lunch
13:00 Coffee
14:00 Emil Jeřábek: Pigeons for Lagrange
15:00 Francisco Felix Lara Martin: On collapse properties of local induction rules
15:30 Coffee
16:00 Gilda Ferreira: Analysis in weak systems
16:30 Ján Pich: Feasibly constructive proofs of succinct weak circuit lower bounds
17:00 End of talks
19:00 Villa Lanna
Friday, November 3nd
09:00 Coffee
09:15 Petr Glivický: Shepherdson's theorems for fragments of open induction
09:45 Jan Krajíček: Expansions of pseudo-finite structures
10:45 Coffee
11:15 Arnold Beckmann: Consistency of equational theories and the separation problem for bounded arithmetic
12:15 Lunch
13:00 Coffee
14:00 Leszek Kołodziejczyk: Separating Jeřábek's theory for approximate counting from bounded arithmetic
15:00 Anupam Das: Some theories of bounded arithmetic for monotone (proof) complexity
15:30 Coffee
16:00 Konrad Zdanowski: Truth predicates for Delta_0 formulas and PSPACE computations
16:30 Chris Pollett: Normal forms from witnessing arguments
17:00 Amir Tabatabai: Computational flows in arithmetic
17:30 End of talks

Workshop dinner

Funded by

FEALORA ERC grant and the Institute of Mathematics

For questions about hotels and reimbursement for travel, please contact Dr. Beata Kubis