The next Dartmouth Logic Seminar this Winter will be on Wednesday, February 20, at 3:00pm in Kemeny 120. The speaker will be Marcia Groszek (Dartmouth College).
Title: The Strength of Ramsey’s Theorem for Pairs
Abstract: We will review the forcing argument in Seetapun and Slaman 1995 showing that Ramsey’s theorem for pairs is weaker than arithmetic comprehension. We may look at the complications involved in trying to do a similar argument for the binary tree version.