Notes on Polynomially Bounded Arithmetic

Zambella, Domenico

J. Symbolic Logic, Tome 61 (1996) no. 1, p. 942-966 / Harvested from Project Euclid

Résumé

We 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.

Publié le : 1996-09-14
Classification:

@article{1183745086,
     author = {Zambella, Domenico},
     title = {Notes on Polynomially Bounded Arithmetic},
     journal = {J. Symbolic Logic},
     volume = {61},
     number = {1},
     year = {1996},
     pages = { 942-966},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745086}
}

Zambella, Domenico. Notes on Polynomially Bounded Arithmetic. J. Symbolic Logic, Tome 61 (1996) no. 1, pp.  942-966. http://gdmltest.u-ga.fr/item/1183745086/