BLASS. A., A game semantics for linear logic CENZER, D. and REMMEL, J., Polynomial-time Abehan groups CLOTE, P. and TAKEUTI, G., Bounded arithmetic for NC, ALogTIME, L and NL [Book Review]

, &
Annals of Pure and Applied Logic 56:365 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Bounded arithmetic for NC, ALogTIME, L and NL.P. Clote & G. Takeuti - 1992 - Annals of Pure and Applied Logic 56 (1-3):73-117.
The equivalence of theories that characterize ALogTime.Phuong Nguyen - 2009 - Archive for Mathematical Logic 48 (6):523-549.
On theories of bounded arithmetic for NC 1.Emil Jeřábek - 2011 - Annals of Pure and Applied Logic 162 (4):322-340.
AsperoH, D. and Bagaria, J., Bounded forcing axioms and the continuum (3) 179} 203 Bagaria, J., see AsperoH, D.(3) 179} 203 Balcar, B. and Simon, P., The name for Kojman} Shelah collapsing function (1} 2) 131} 137. [REVIEW]G. JaKger, R. Kahle & T. Studer - 2001 - Annals of Pure and Applied Logic 109:243.
Review: Jan Krajicek, Pavel Pudlak, Gaisi Takeuti, Bounded Arithmetic and the Polynomial Hierarchy; Samuel R. Buss, Relating the Bounded Arithmetic and Polynomial Time Hierarchies; Domenico Zambella, Notes on Polynomially Bounded Arithmetic. [REVIEW]Stephen Cook - 1999 - Journal of Symbolic Logic 64 (4):1821-1823.
Relating the bounded arithmetic and polynomial time hierarchies.Samuel R. Buss - 1995 - Annals of Pure and Applied Logic 75 (1-2):67-77.
Cancellation laws for polynomial-time p-isolated sets.John N. Crossley & J. B. Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):147-172.
O'Donnell, MJ, see Lipton, J. 187-239 Remmel, JB, see Nerode, A. 125-170.S. Feferman - 1996 - Annals of Pure and Applied Logic 81:241.
A nonasymptotic lower time bound for a strictly bounded second-order arithmetic.Anatoly P. Beltiukov - 2006 - Annals of Pure and Applied Logic 141 (3):320-324.
Bounded arithmetic and the polynomial hierarchy.Jan Krajíček, Pavel Pudlák & Gaisi Takeuti - 1991 - Annals of Pure and Applied Logic 52 (1-2):143-153.

Analytics

Added to PP
2014-03-30

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Current Trends in Substructural Logics.Katalin Bimbó - 2015 - Journal of Philosophical Logic 44 (6):609-624.

Add more citations

References found in this work

No references found.

Add more references