Many Facets of Complexity in Logic
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
PBINT, a logic for modelling search problems involving arithmetic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Closure properties of weak systems of bounded arithmetic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
| Hi-index | 0.00 |
Abstract: We introduce a second-order system V1-Horn of bounded arithmetic formalizing polynomial-time reasoning, based on Grädel's [15] second-order Horn characterization of P. Our system has comprehension over P predicates (defined by Grädel's second-order Horn formulas), and only finitely many function symbols. Other systems of polynomial-time reasoning either allow induction on NP predicates (such as Buss's S12 or the second-order V11), and hence are more powerful than our system (assuming the polynomial hierarchy does not collapse), or use Cobham's theorem to introduce function symbols for all polynomial-time functions (such as Cook's PV and Zambella's P-def). We prove that our system is equivalent to QPV and Zambella's P-def. Using our techniques, we also show that V1-Horn is finitely axiomatizable, and, as a corollary, that the class of \forall\Sigma_1^b consequences of S12 is finitely axiomatizable as well, thus answering an open question.