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
102 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献