Binary models generated by their tally part
This paper deals with theories of bounded arithmetic, and with a question of Wilkie and Paris. We introduce and study a class of models of the bounded theory \(\text{PV}_ n\). These models, which are generated by their tally part, have a curious feature: they are end-extendable or satisfy the bounded collection scheme for \(\Sigma^ b_ n\)-formulae only if they are closed under exponentiation. As an application, we show that if the theory \(I\Delta_ 0+\neg\exp\) proves the bounded collection scheme, then the polynomial time hierarchy does not collapse (and, \textit{a fortiori}, \(\text{P}\neq\text{NP}\)).
- Bounded arithmetic and the polynomial hierarchy
- scientific article; zbMATH DE number 4137758 (Why is no real title available?)
- scientific article; zbMATH DE number 4160708 (Why is no real title available?)
- scientific article; zbMATH DE number 3689386 (Why is no real title available?)
- scientific article; zbMATH DE number 176204 (Why is no real title available?)
- Provability of the pigeonhole principle and the existence of infinitely many primes
This page was built for publication: Binary models generated by their tally part
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337500)