Notes on polynomially bounded arithmetic

Journal of Symbolic Logic

Volumn 61, Issue 3, 1996, Pages 942-966

  Zambella, Domenico ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030510798     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275794     Document Type: Article

References (17)

1. 1-formulas on finite structures, Annals of Pure and Applied Logic, vol. 24 (1983), pp. 1-48.
2. _, The complexity of the pigeonhole principle, IEEE (1988), pp. 346-355.
3. S. R. BUSS, Bounded arithmetic, Bibliopolis, Naples, 1986.
4. _, Axiomatizations and conservations results for fragments of bounded arithmetic, Logic and computation, Contemporary Mathematics, vol. 106, A.M.S., 1990, proceeding of a workshop held at Carnegie-Mellon University, 1987, pp. 57-84.
5. _, Relating the bounded arithmetic and polynomial time hierarchies, to appear.
6. A. COBHAM, The intrinsic computational difficulty of functions, Structure in complexity theory (A. L. Selman, editor), Lecture Notes in Computational Science, vol. 221, 1986, pp. 125-146.
7. P. HÁJEK and P. PUDLÁK, Metamathematics of first-order arithmetic, Springer-Verlag, Berlin, 1993.
8. J. KADIN, The polynomial time hierarchy collapses if the Boolean hierarchy collapses, IEEE (1988), pp. 278-292.
9. J. KRAJÍCĚK, Exponentiation and second order bounded arithmetic, Annals of Pure and Applied Logic, vol. 48 (1990), pp. 261-276.
10. J. KRAJÍCĚK, P. PUDLÁK, and G. TAKEUTI, Bounded arithmetic and the polynomial time hierarchy, Annals of Pure and Applied Logic, vol. 52 (1991), pp. 143-153.
11. G. E. MINTS, Quantifier-free and one-quantifier systems, Zapiski Nauchnykh Seminarov, vol. 20 (1971), pp. 115-133, in Russian. English translation: Journal of Soviet Mathematics, vol. 1 (1973), pp. 211-266.
12. G. E. MINTS, Quantifier-free and one-quantifier systems, Zapiski Nauchnykh Seminarov, vol. 20 (1971), pp. 115-133, in Russian. English translation: Journal of Soviet Mathematics, vol. 1 (1973), pp. 211-266.
13. n-collection schemas in arithmetic, Logic colloquium 77 (A. Macintyre, L. Pacholski, and J. Paris, editors), North-Holland, Amsterdam, 1978, pp. 199-209.
14. C. PARSONS, On a number theoretic choice schema and its relation to induction, Intuitionism and proof theory (Kino, Myhill, and Vesley, editors), North-Holland, Amsterdam, 1970, pp. 459-473.
15. A. RAZBOROV, An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic, Arithmetic, proof theory and computational complexity (P. Clote and J. Krajícěk, editors), Oxford University press, Oxford, 1993, pp. 247-277.
16. G. TAKEUTI, RSUV isomorphisms, Arithmetic, proof theory and computational complexity (P. Clote and J. Krajícěk, editors), Oxford University press, Oxford, 1993, pp. 364-386.
17. A. J. WILKIE, Modelès non standard de l'arithmétique et complexitè algorithmique, Modelés non standard de l'arithmétique et theorie des ensembles (A. J. Wilkie and J. Ressayre, editors), Publications Mathématique de l'Université Paris VII, Paris, 1983, pp. 1-45.