1. Buss, S.: Bounded arithmetic. Princeton 1985, Thesis, Napoli, Bibliopolis 1986, (Reprinted)
2. Ferrante, J., Rackoff, C.W.: The computational complexity of logical theories. Lect. Notes 718, 153?161 (1979)
3. Kalsbeek, M.B.: An orey sentence for predicative arithmetic. ITLI Prepublication Series X-8-01, Department of Mathematic and Computer Science, University of Amsterdam (1989)
4. Kraj�?ek, J.: A note on proofs of falsehood. Arch. Math. Grundlagenforsch.26, 169?176 (1987)
5. Parikh, R.: Existence and feasibility in arithmetic. J. Symb. Logic36, 494?508 (1971)