Add to ORKGWe show that certain model-theoretic forcing arguments involving sub-systems of second-order arithmetic can be formalized in the base the-ory, thereby converting them to effective proof-theoretic arguments. We use this method to sharpen conservation theorems of Harrington and Brown-Simpson, giving an effective proof that WKL+0 is conservative over RCA0 with no significant increase in the lengths of proofs.
Conservative logic is a comprehensive model of computation which explicitly reflects a number of fun...
We survey some recent results on the impact of strong forcing axioms such as the Proper Forcing Axio...
summary:By the technique of forcing, some new independence results are proved for the alternative se...
We show that certain model-theoretic forcing arguments involving sub-systems of second-order arithme...
We show that certain model-theoretic forcing arguments involving subsystems of second-order arithmet...
Received: date / Revised version: date Abstract Leo Harrington showed that the second-order theory o...
Leo Harrington showed that the second-order theory of arithmetic WKL0 is Π11-conservative over the t...
Abstract. Paul Cohen's method of forcing, together with Saul Kripke's related semantics fo...
We review and describe the main techniques for setting up systems of weak analysis, i.e. formal sys...
Abstract. Paul Cohen's method of forcing, together with Saul Kripke's related semantics fo...
We define a weak second--order extension of first--order logic. We prove a second--order cut elimina...
We give two characterizations of conservative extensions of models of arithmetic, in terms of the ex...
Introduction This short note presents two simple applications of the notion of boolean models for f...
The questions underlying the work presented here on subsystems of second order arithmetic are the fo...
International audienceThis paper is a study of the forcing translation through the proofs as program...
Conservative logic is a comprehensive model of computation which explicitly reflects a number of fun...
We survey some recent results on the impact of strong forcing axioms such as the Proper Forcing Axio...
summary:By the technique of forcing, some new independence results are proved for the alternative se...
We show that certain model-theoretic forcing arguments involving sub-systems of second-order arithme...
We show that certain model-theoretic forcing arguments involving subsystems of second-order arithmet...
Received: date / Revised version: date Abstract Leo Harrington showed that the second-order theory o...
Leo Harrington showed that the second-order theory of arithmetic WKL0 is Π11-conservative over the t...
Abstract. Paul Cohen's method of forcing, together with Saul Kripke's related semantics fo...
We review and describe the main techniques for setting up systems of weak analysis, i.e. formal sys...
Abstract. Paul Cohen's method of forcing, together with Saul Kripke's related semantics fo...
We define a weak second--order extension of first--order logic. We prove a second--order cut elimina...
We give two characterizations of conservative extensions of models of arithmetic, in terms of the ex...
Introduction This short note presents two simple applications of the notion of boolean models for f...
The questions underlying the work presented here on subsystems of second order arithmetic are the fo...
International audienceThis paper is a study of the forcing translation through the proofs as program...
Conservative logic is a comprehensive model of computation which explicitly reflects a number of fun...
We survey some recent results on the impact of strong forcing axioms such as the Proper Forcing Axio...
summary:By the technique of forcing, some new independence results are proved for the alternative se...