University of Birmingham > Talks@bham > Lab Lunch > How to stratify PSPACE-complete logics into fragments complete for each level of the polynomial time hierarchy?

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

How to stratify PSPACE-complete logics into fragments complete for each level of the polynomial time hierarchy?

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

If you have a question about this talk, please contact Anupam Das.

The key idea is to encode proof search in the given logic as a Quantified Boolean Formula in an optimal way. I will illustrate the method originally developed by Anupam, on the case of modal logic K.

This talk is part of the Lab Lunch series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Postgraduate Algebra Seminar Cond. Mat. seminar EPS - College Research Teas

Other talks

TBC Horizontal Mean Curvature Flow and stochastic optimal controls TBA Life : it’s out there, but what and why ? Quantum Sensing in Space Hunt for an Earth-twin
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.