By forcing with Pmax over strong models of determinacy, we obtain models
where different square principles at omega_2 and omega_3 fail. In particular,
we obtain a model of 2^{aleph_0}=2^{aleph_1}=aleph_2 + square(omega_2) fails +
square(omega_3) fails.
There is a fascinating interplay and overlap between recursion theory and
descriptive set theory. A particularly beautiful source of such interaction has
been Martin's conjecture on Turing invariant functions. This longstanding open
problem in recursion theory has connected to many problems in descriptive set
theory, particularly in the theory of countable Borel equivalence relations.