Abstract
AbstractWe characterize the collapse of Buss' bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.
Publisher
Cambridge University Press (CUP)
Reference16 articles.
1. ∑11-Formulae on finite structures
2. Quantifier-free and one-quantifier systems;Mints;Zapiski Nauchnykh Seminarov,1971
3. Exponentiation and second-order bounded arithmetic
Cited by
100 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Elementary analytic functions in VTC0;Annals of Pure and Applied Logic;2023-06
3. Models of VTC0$\mathsf {VTC^0}$ as exponential integer parts;Mathematical Logic Quarterly;2023-05
4. Iterated multiplication in $$ VTC ^0$$;Archive for Mathematical Logic;2022-01-04
5. Induction rules in bounded arithmetic;Archive for Mathematical Logic;2019-11-12