A long pseudo-comparison of premice in L[x]

Publication date 21 December 2018

Abstract: We describe an obstacle to the analysis of

m a t h r m {H O D}^{L [x]}

as a core model: Assuming sufficient large cardinals, for a Turing cone of reals

x

there are premice

M, N

in

m a t h r m {H C}^{L [x]}

such that the pseudo-comparison of

L [M]

with

L [N]

succeeds, is computed in

L [x]

, and lasts through

o m e g a_{1}^{L [x]}

stages. Moreover, we can take

M = M_{1} | (d e l t a^{+})^{M_{1}}

where

M_{1}

is the minimal iterable proper class inner model with a Woodin cardinal, and

d e l t a

is that Woodin. We can take

N

such that

L [N]

is

M_{1}

-like and short-tree-iterable.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: A long pseudo-comparison of premice in \(L[x]\)