Yet more forcing in arithmetic: life in a second-order world
This was a talk in CUNY’s MoPA seminar.
In previous semesters of this seminar, I have talked about how the technique of forcing, originally developed by Cohen for building models of set theory, can be used to produce models of arithmetic with various properties. In this talk, I will present a forcing proof of Harrington’s theorem on the conservativity of over . More formally, any countable model of can be extended to a model of with the same first-order part. As an immediate corollary, we get that any sentence provable by is already provable by .