Abstract

Most of this work is devoted to presenting aspects of proof theory that have developed out of Gentzen's work. Thus the them is "cut elimination" and transfinite induction over constructive ordinals. Smullyan's tableau systems will be used for the formalisms and some of the basic logical results as presented in Smullyan [1] will be assumed to be known (essentially only the classical completeness and consistency proofs for propositional and first order logic).