Chong Chi Tat: $TT^1$, Part II

Invitation to the Logic Seminar at the National University of Singapore

Date: Wednesday, 12 February 2014, 17:00 hrs

Room: S17#04-05, Department of Mathematics, NUS

Speaker: Chong Chi Tat

Title: TT^1, Part II.

URL: http://www.comp.nus.edu.sg/~fstephan/logicseminar.html

In the previous part I, Li Wei gave the following talk: TT^1 says that for
any colouring of the binary tree with finitely many colours, there is
a homogeneous perfect subtree. Classically, TT^1 is proved by Sigma_2
Induction. In this talk, we will examine TT^1 without Sigma_2 Induction
and show that for some recursive colouring, no homogeneous perfect subtree
is below 0″.
This is now the second part of this series of talks on TT^1.