HOD in inner models with Woodin cardinals

Abstract

We analyze the hereditarily ordinal definable sets HOD in Mn(x)[g] for a Turing cone of reals x, where Mn(x) is the canonical inner model with n Woodin cardinals build over x and g is generic over Mn(x) for the L\'evy collapse up to its bottom inaccessible cardinal. We prove that assuming 1n+2-determinacy, for a Turing cone of reals x, HODMn(x)[g] = Mn(M∞ | ∞, ), where M∞ is a direct limit of iterates of Mn+1, δ∞ is the least Woodin cardinal in M∞, ∞ is the least inaccessible cardinal in M∞ above δ∞, and is a partial iteration strategy for M∞. It will also be shown that under the same hypothesis HODMn(x)[g] satisfies GCH.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…