mpla.math.uoa.gr
Font size: Αα Αα Αα hide gadgets
You are here: Defenses » July 2017 » Theodoros Papamakarios Anonymously browsing from 54.224.168.206 at 04:31:43, 18-11-2017. login
download defense details: { pdf }

MSc thesis defense presentation

Theodoros Papamakarios defends his MSc thesis

Date: Wednesday, 19 Jul 2017
Time: 13:00
Location: School of Electrical and Computer Engineering (old buildings), 1.1.31
Thesis title: Proof Complexity: A Tableau Perspective
Committee:

Thesis abstract

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.

Reporter

Page updates

No recent updates.

Feeds RSS and Atom feeds

posts
all posts RSS
news RSS
announcements RSS
website news RSS
events
all events RSS
defenses RSS
exams RSS
seminars RSS
graduations RSS
Web standards: XHTML1.0, CSS3.
© 1996 – 2017 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.