Notes on polynomially bounded arithmetic

Journal of Symbolic Logic 61 (3):942-966 (1996)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275794
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,664
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
M. Ajtai (1983). ∑11-Formulae on Finite Structures. Annals of Pure and Applied Logic 24 (1):1-48.

Add more references

Citations of this work BETA
Emil Jeřábek (2011). On Theories of Bounded Arithmetic For. Annals of Pure and Applied Logic 162 (4):322-340.

View all 15 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

23 ( #204,570 of 1,903,037 )

Recent downloads (6 months)

1 ( #446,009 of 1,903,037 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.