Date of Original Version




Published In

Journal of Logic and Algebraic Programming (2001), 49: 15-30.

Rights Management

All Rights Reserved

Abstract or Table of Contents

Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presented, and are used to show how one can sometimes extract a constructive proof and an algorithm from a proof that is nonconstructive. A variation of the double-negation translation is also discussed: if phi is provable classically, then ¬(¬phi)nf is provable in minimal logic, where θnf denotes the negation-normal form of θ. The translation is used to show that cut-elimination theorems for classical logic can be viewed as special cases of the cut-elimination theorems for intuitionistic logic.

Included in

Philosophy Commons