MSc thesis of Θεόδωρου Παπαμακάριου
Proof Complexity: A Tableau Perspective
Supervisors: Σταύρος Κοσμαδάκης, Ευστάθιος Ζάχος
The method of semantic tableaux (or simply tableaux) is arguably one of the most elegant proof systems. Unfortunately, it hasn't received much attention in the proof complexity literature, mainly due to early negative results, concerning the complexity of cut-free tableaux. We bring tableaux to the fore, introducing the measures of tableau depth and width. Equipped with these, we show in an elegant, uniform way several known results spanning proof complexity, from a tableau viewpoint.
Defended: 19 Ιουλίου 2017.