Research Interests:
Research Interests:
Abstract. We describe a sequent calculus MJ, based on work of Herbelin, of which the cutfree derivations are in 1-1 correspondence with the normal natural deduction proofs of intuitionistic logic. MJ (without cut) has the sub-formula... more
Abstract. We describe a sequent calculus MJ, based on work of Herbelin, of which the cutfree derivations are in 1-1 correspondence with the normal natural deduction proofs of intuitionistic logic. MJ (without cut) has the sub-formula property and is therefore convenient for automated proof search; it admits no permutations and therefore avoids some of the backtracking problems in LJ. We present a simple new proof of Herbelin's strong cut elimination theorem for this calculus.