skip to content

On lower bounds in non-classical logics

Presented by: 
P Pudlak [Czech Academy of Sciences]
Monday 24th April 2006 - 11:00 to 12:00
INI Seminar Room 1

Whereas for classical logic it seems to be an extremely difficult problem, for some non-classical logics it is possible to prove exponential lower bounds on the lengths of proofs in (system based on axioms and derivation rules). For some modal logics recently such unconditional lower bounds have been proved. For intuitionistic logic we have only results based on unproven assumptions.

Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons