On December 1st 2016 I gave a talk in the KGRC Research Seminar.

Abstract: Let x be a real of sufficiently high Turing degree, let κx be the least inaccessible cardinal in L[x] and let G be Col(ω,<κx)-generic over L[x]. Then Woodin has shown that HODL[x,G] is a core model, together with a fragment of its own iteration strategy.

Our plan is to extend this result to mice which have finitely many Woodin cardinals. We will introduce a direct limit system of mice due to Grigor Sargsyan and sketch a scenario to show the following result. Let n1 and let x again be a real of sufficiently high Turing degree. Let κx be the least inaccessible strong cutpoint cardinal of Mn(x) such that κx is a limit of strong cutpoint cardinals in Mn(x) and let g be Col(ω,<κx)-generic over Mn(x). Then HODMn(x,g) is again a core model, together with a fragment of its own iteration strategy.

This is joint work in progress with Grigor Sargsyan.

Many thanks to Richard again for the great pictures!