University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Toda's theorem in bounded arithmetic with parity quantifiers and bounded depth proof systems with parity gates

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity