Unprovability of theorems of complexity theory in weak number theories

This publication has 4 references indexed in Scilit:

• The optimality of induction as an axiomatization of arithmetic
  The Journal of Symbolic Logic, 1983
• The Expressiveness of Simple and Second-Order Type Structures
  Journal of the ACM, 1983
• Independence results in computer science
  ACM SIGACT News, 1976
• On the computational complexity of algorithms
  Transactions of the American Mathematical Society, 1965