Conservation theorems on semi-classical arithmetic
Abstract
We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic PA and intuitionistic arithmetic HA. Using a generalized negative translation, we first provide a new structured proof of the fact that PA is k+2-conservative over HA + k-LEM where k-LEM is the axiom scheme of the law-of-excluded-middle restricted to formulas in k. In addition, we show that this conservation theorem is optimal in the sense that for any semi-classical arithmetic T, if PA is k+2-conservative over T, then T proves k-LEM. In the same manner, we also characterize conservation theorems for other well-studied classes of formulas by fragments of classical axioms or rules. This reveals the entire structure of conservation theorems with respect to the arithmetical hierarchy of classical principles.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.