A Constructive Proof of Cut Elimination for a System of Full Second Order Logic

Abstract

In this paper we present a constructive proof of cut elimination for a system of full second order logic with the structural rules absorbed and using sets instead of sequences. The standard problem of the cutrank growth is avoided by using a new parameter for the induction, the cutweight. This technique can also be applied to first order logic.

arXiv commentThis paper has been withdrawn by the author due to crucial errors noted by reviewers: no cut-elimination proof for second-order logic can be formalized in second-order arithmetic. The author's arguments are formalizable in a subsystem of Kalmar-elementary arithmetic. So the purported proof seems patently wrong