In proof theory we investigate the objects used for computations and arguments in computer science and mathematics. Our starting point is the classical analysis given by Gerhard Gentzen in the 1930s. We develop this further using a new theory of ordinal notation and connecting this with combinatorics on finite trees.