Developing logical theories for several NP search classes
Seminar Room 1, Newton Institute
AbstractWe present finitely-axiomatizable two-sorted first-order theories associated with several NP search classes in the sense that search problems in a class are precisely those that are provable total in the associated theory. These theories are in the same vein as the family of theories associated with many subclasses of polytime, developed earlier by Nguyen and Cook. We consider proving several theorems in these new theories. (Joint work with Antonina Kolokolova.)
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.