Toda's theorem in bounded arithmetic with parity quantifiers and bounded depth proof systems with parity gates

Add to your list(s) Download to your calendar using vCal

• Kolodziejczyk, L (Uniwersytet Warszawski)
• Thursday 29 March 2012, 11:00-11:30
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact Mustapha Amrani.

Semantics and Syntax: A Legacy of Alan Turing

The “first part” of Toda’s theorem states that every language in the polynomial hierarchy is probabilistically reducible to a language in $oplus P$. The result also holds for the closure of the polynomial hierarchy under a parity quantifier.

We use Jerabek’s framework for approximate counting to show that this part of Toda’s theorem is provable in a relatively weak fragment of bounded arithmetic with a parity quantifier. We discuss the significance of the relativized version of this result for bounded depth propositional proof systems with parity gates.

Joint work with Sam Buss and Konrad Zdanowski.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.