@InProceedings{tzameret:LIPIcs.CSL.2020.5,
author = {Tzameret, Iddo},
title = {{From Classical Proof Theory to P versus NP: a Guide to Bounded Theories}},
booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)},
pages = {5:1--5:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-132-0},
ISSN = {1868-8969},
year = {2020},
volume = {152},
editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.5},
URN = {urn:nbn:de:0030-drops-116482},
doi = {10.4230/LIPIcs.CSL.2020.5},
annote = {Keywords: Bounded arithmetic, complexity class separations, circuit complexity, proof complexity, weak theories of arithmetic, feasible mathematics}
}