Separation of bounded arithmetic using a consistency statement
Yoriyuki Yamagata

TL;DR
This paper demonstrates that certain hierarchies of bounded arithmetic do not collapse and connects these results to the P vs NP problem, using consistency statements and formal systems.
Contribution
It proves non-collapse of Buss's hierarchy of bounded arithmetics and relates it to P ≠ NP via consistency statements involving fragments of PV systems.
Findings
Hierarchy of bounded arithmetics does not collapse.
S^1_2 does not prove the consistency of certain PV fragments.
Higher systems can prove the consistency of these fragments.
Abstract
This paper proves Buss's hierarchy of bounded arithmetics does not entirely collapse. More precisely, we prove that, for a certain , holds. Further, we can allow any finite set of true quantifier free formulas for the BASIC axioms of . By Takeuti's argument, this implies . Let be a certain formulation of BASIC axioms. We prove that for sufficiently large , while for a system , a fragment of the system , induction free first order extension of Cook's , of which proofs contain only formulas with less than connectives. $S^1_2…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Complexity and Algorithms in Graphs
