Bounded arithmetic and computational complexity

A survey of certain characterizations of complexity classes in an algebraic, machine-independent manner is presented, together with some applications to weak theories of arithmetic and higher-order functionals. Function algebras are examined, and hierarchies are defined. Bounded arithmetic theories are presented.<
>