Switch to: Citations

References in:

Bounded arithmetic and the polynomial hierarchy

Jan Krajíček, Pavel Pudlák & Gaisi Takeuti

Annals of Pure and Applied Logic 52 (1-2):143-153 (1991)

Add references

You must login to add references.

(1 other version)Quantified propositional calculi and fragments of bounded arithmetic.Jan Krajíček & Pavel Pudlák - 1990 - Mathematical Logic Quarterly 36 (1):29-46.details Download Export citation Bookmark 24 citations
Provability of the pigeonhole principle and the existence of infinitely many primes.J. B. Paris, A. J. Wilkie & A. R. Woods - 1988 - Journal of Symbolic Logic 53 (4):1235-1244.details Download Export citation Bookmark 28 citations
On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.details Download Export citation Bookmark 96 citations
(1 other version)Quantified propositional calculi and fragments of bounded arithmetic.Jan Krajíček & Pavel Pudlák - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (1):29-46.details Download Export citation Bookmark 24 citations

1