A generalization of a conservativity theorem for classical versus intuitionistic arithmetic
A generalization of a conservativity theorem for classical versus intuitionistic arithmetic
复制标题
经典算术与直觉算术的保守性定理的推广
DOI:
10.1002/malq.200310074
复制
发表时间:
2004
影响因子:
0.3
通讯作者:
S. Berardi
中科院分区:
文献类型:
--
作者:
S. Berardi
A basic result in intuitionism is Π02‐conservativity. Take any proof p in classical arithmetic of some Π02‐statement (some arithmetical statement ∀x.∃y.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. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)