|
Takeuti, Gaisi Bounded arithmetic and truth definition. Ann. Pure Appl. Logic 39 (1988), no. 1, 75--104
Buss, Samuel R. Bounded arithmetic. Studies in Proof Theory. Lecture Notes, 3. Bibliopolis, Naples, 1986. vi+221 pp. ISBN: 88-7088-150-4
Clote, Peter Bounded arithmetic and computational complexity. Fifth Annual Structure in Complexity Theory Conference (Barcelona, 1990), 186--199,
Krají\v cek, Jan Bounded arithmetic, propositional logic, and complexity theory. Encyclopedia of Mathematics and its Applications, 60. Cambridge University Press, Cambridge, 1995. xiv+343 pp. ISBN: 0-521-45205-8
Pollett, Chris Structure and definability in general bounded arithmetic theories. Ann. Pure Appl. Logic 100 (1999), no. 1-3, 189--245.
Buss, Samuel R. Bounded arithmetic, cryptography and complexity. The arithmetization of metamathematics. Theoria 63 (1997), no. 3, 147--167.
Buss, Samuel R. Bounded arithmetic and propositional proof complexity. Logic of computation (Marktoberdorf, 1995), 67--121, NATO Adv. Sci. Inst. Ser. F Comput. Systems Sci., 157, Springer, Berlin, 1997.
Krají\v cek, Jan Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symbolic Logic 62 (1997), no. 2, 457--486.
Takeuti, Gaisi Gödel sentences of bounded arithmetic. J. Symbolic Logic 65 (2000), no. 3, 1338--1346.
Beckmann, Arnold; Pollett, Chris; Buss, Samuel R. Ordinal notations and well-orderings in bounded arithmetic. Ann. Pure Appl. Logic 120 (2003), no. 1-3, 197--223
|
