Skip to content

LAA

Seminar

On lower bounds in non-classical logics

Pudlak, P (Czech Academy of Sciences)
Monday 24 April 2006, 11:00-12:00

Seminar Room 1, Newton Institute

Abstract

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.

Audio

MP3MP3 Real AudioReal Audio

Back to top ∧