Quantified Boolean Formulas (QBF) extend classical Boolean logic by incorporating quantifiers over Boolean variables, thereby enabling the expression of problems in the PSPACE complexity class. The ...

Proof pulls its audience in with a storyline that never fails to captivate: the tale of a troubled genius. The audience can imagine piles of notebooks teeming with scribbles as they watch irritable, ...

We give a general reduction of lengths-of-proofs lower bounds for constant depth Frege systems in DeMorgan language augmented by a connective counting modulo a prime p (the so-called AC0[p] Frege ...

Vol. 7, No. 4, Special Issue on Recent Advances in Logical and Algebraic Approaches to Grammar (Oct., 1998), pp. 433-447 (15 pages) This paper shows how proof nets can be used to formalize the notion ...

To help curb the spread of covid-19 by exercising "social distancing", we will be cancelling our regular theory seminars immediately until further notice. A half-space (over the Boolean hypercube) is ...

The European Association for Theoretical Computer Science has recognized Professor Toni Pitassi of the department of computer science in the Faculty of Arts & Science with the 2021 EATCS Distinguished ...