FEALORA Workshop 2018

When and where



See abstracts
Monday, November 5th
09:00 Petr Glivický: Model theory of linear fragments of Peano arithmetic
10:00 Jan Bydžovský: Polynomial time ultrapowers and the consistency of circuit lower bounds
10:30 Coffee
11:00 Leszek Kołodziejczyk: Feasibility of some classical conservation results in arithmetic
12:00 End of talks
12:30 Lunch
15:30 Coffee
16:00 Fedor Pakhomov: Collection and Speed-up
17:00 Emil Jeřábek: Bounded induction without parameters
17:30 Amir Tabatabai: Reduction Programs and Higher Search Problems in Bounded Arithmetic
18:00 End of talks
Tuesday, November 6th
09:00 Pavel Pudlák
10:00 Arnold Beckmann: On Transformations of Constant Depth Propositional Proofs
10:30 Coffee
11:00 Sam Buss: DRAT Proofs and Extensions
12:00 End of talks
12:30 Lunch
15:30 Coffee
16:00 Ilario Bonacina: k-Clique is Hard on Average for Regular Resolution
16:30 Massimo Lauria: Graph Colouring is Hard for Algorithms Based on Hilbert’s Nullstellensatz and Gröbner Bases
17:00 Stefan Dantchev: Resolution and the binary encoding of combinatorial principles
17:30 Neil Thapen: Approximate counting and NP search problems
18:00 End of talks
Wednesday, November 7th
09:00 Azza Gaysin: The structure of weighted clones over the clones of the Post lattice
09:30 Lukáš Folwarczný: Graph communication protocols
10:00 Raheleh Jalali: On lengths of proofs in centered calculi
10:30 Coffee
11:00 Navid Talebanfard: On the Fine-Grained Proof Complexity of Tseitin Tautologies
11:30 End of talks

Organizing committee