Abstract
We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic and intuitionistic arithmetic . Using a generalized negative translation, we first provide a new structured proof of the fact that is -conservative over where is the axiom scheme of the law-of-excluded-middle restricted to formulas in . In addition, we show that this conservation theorem is optimal in the sense that for any semi-classical arithmetic , if is -conservative over , then proves . 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.