Abstract

We show that certain model-theoretic forcing arguments involving subsystems of second-order arithmetic can be formalized in the base theory, 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 W KL+0 is conservative over RCA0 with no significant increase in the lengths of proofs. 1

Citations

411	Recursively Enumerable Sets and Degrees - Soare - 1987
227	Set Theory: An Introduction to Independence Proofs - Kunen - 1983
103	Π 0 1 classes and degrees of theories - Soare - 1972
24	On the length of proofs of finitistic consistency statements in finitistic theories - Pudlák - 1986
9	The Baire category theorem in weak subsystems of second-order arithmetic - BROWN, SIMPSON - 1993
8	Fragments of arithmetic, Annals of Pure and - SIEG - 1985
8	Subsystems of Z2 and reverse mathematics, appendix to G. Takeuti, Proof Theory, 2nd edition - Simpson - 1986
7	Interpretability and fragments of arithmetic - Hájek
5	On the strength of König’s duality theorem of countable bipartite graphs - Simpson - 1994
4	Herbrand analyses. Archive for - Sieg - 1991
2	Fragments of First and Second Order Arithmetic and Length of Proofs - Ignjatovi'c - 1990
1	Proof-Theoretic Investigations of Subsystems of SecondOrder Arithmetic - Avigad - 1995