A generalization of a conservativity theorem for classical versus intuitionistic arithmetic

摘要

A basic result in intuitionism is Π_0~2-conservativity. Take any proof p in classical arithmetic of some Π_0~2-statement (some arithmetical statement _x. _.P(x, y), with P decidable). Then we may effectively turn p in some intuitionistic proof of the same statement. In a previous paper [1], we generalized this result: any classical proof p of an arithmetical statement _x. _y.P(x, y), with P of degree k, may be effectively turned into some proof of the same statement, using Excluded Middle only over degree k formulas. When k = 0, we get the original conservativity result as particular case. This result was a by-product of a semantical construction. J. Avigad of Carnegie Mellon University, found a short, direct syntactical derivation of the same result, using H. Friedman's A-translation. His proof is included here with his permission.