We define a theory of two-sort bounded arithmetic whose provably total functions are exactly those in FLOGCFL by way of a generalized quantifier that expresses computations of SAC1 circuits. Theâ€¦ (More)

We de ne a hierarchy of circuit complexity classes LD , whose depth are the inverse of a function in Ackermann hierarchy. Then we introduce extremely weak versions of length induction called LIND andâ€¦ (More)

We show that length initial submodels of S 2 can be extended to a model of weak second order arithmetic. As a corollary we show that the theory of length induction for polynomially bounded secondâ€¦ (More)

In this paper we give a two sort bounded arithmetic whose provably total functions coincide with the class FP . Our first aim is to show that the theory proves Todaâ€™s theorem in the sense that anyâ€¦ (More)

We characterize iterated log depth circuit classes between AC0 and AC1 by Cobham-like bounded recursion schemata. We also give alternative characterizations which utilize the safe recursion methodâ€¦ (More)

We de ne a hierarchy of bounded arithmetic L i 2 for i 1 which are modi cations of TAC of Clote and Takeuti. Provably total functions of L i 2 are characterized in terms of circuit complexity. As aâ€¦ (More)

The discovery of the non-peptide antiplatelet injectable agent FK419 is reported. Based on the beta-turn structure of RGD peptide sequences in the alpha chain of fibrinogen, which binds theâ€¦ (More)

The aim of this study was to improve the performance status of prostate cancer patients during high-dose-rate interstitial brachytherapy (HDR-ISBT). To this end, we have developed a new ambulatoryâ€¦ (More)