Weak theories of operations and types

This is a survey paper on various weak systems of Feferman’s explicit mathematics and their proof theory. The strength of the systems considered in measured in terms of their provably terminating operations typically belonging to some natural classes of computational time or space complexity. Keywords: Proof theory, Feferman’s explicit mathematics, applicative theories, higher types, types and names, partial truth, feasible operations

Weak theories of operations and types

SIGLEAvailable from British Library Document Supply Centre- DSC:9109.3968(EU-DCS-CSM--200) / BLDSC - British Library Document Supply CentreGBUnited Kingdo