Objectives:
We aim to show that increasing logical depth can decrease proof size; to improve logical characterizations of combinatorial proof systems and search problems, and vice versa; to show lower bounds on algebraic proof systems and systems from SAT solving; to develop mathematics over very weak axioms.
Jeřábek Emil Part Fedor |
Pudlák Pavel |
Institute of Mathematics of the czech Academy of Sciences
Mapa | Autor | Webmaster