![]() |
![]() |
University of Birmingham > Talks@bham > Lab Lunch > How to stratify PSPACE-complete logics into fragments complete for each level of the polynomial time hierarchy?
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. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsPostgraduate Algebra Seminar Cond. Mat. seminar EPS - College Research TeasOther talksTBC 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 |