@inbook {IOPORT.00517079,
    author       = {Johannsen, Jan},
    title        = {On the weakness of sharply bounded polynomial induction.},
    year         = {1993},
    booktitle    = {Computational logic and proof theory. 3rd Kurt G\"odel Colloquium, KGC '93, Brno, Czech Republic, August 24-27, 1993. Proceedings},
    isbn         = {3-540-57184-1},
    pages        = {223-230},
    publisher    = {Berlin: Springer-Verlag},
    abstract     = {Summary: We show that if the theory $S\sb 2\sp 0$ if sharply bounded polynomial induction is extended by symbols for certain functions and their defining axioms, it is still far weaker than $T\sb 2\sp 0$, which has ordinary sharply bounded induction. Furthermore, we show that this extended system $S\sb{2+}\sp 0$ cannot $\Sigma\sb 1\sp b$-define every function in $AC\sp 0$, the class of functions computable by polynomial size constant depth circuits.},
    identifier   = {00517079},
}