English

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

Logic 2018-11-14 v2

Abstract

We describe an obstacle to the analysis of HODL[x]\mathrm{HOD}^{L[x]} as a core model: Assuming sufficient large cardinals, for a Turing cone of reals xx there are premice M,NM,N in HCL[x]\mathrm{HC}^{L[x]} such that the pseudo-comparison of L[M]L[M] with L[N]L[N] succeeds, is computed in L[x]L[x], and lasts through ω1L[x]\omega_1^{L[x]} stages. Moreover, we can take M=M1(δ+)M1M=M_1|(\delta^+)^{M_1} where M1M_1 is the minimal iterable proper class inner model with a Woodin cardinal, and δ\delta is that Woodin. We can take NN such that L[N]L[N] is M1M_1-like and short-tree-iterable.

Keywords

Cite

@article{arxiv.1510.01724,
  title  = {A long pseudo-comparison of premice in $L[x]$},
  author = {Farmer Schlutzenberg},
  journal= {arXiv preprint arXiv:1510.01724},
  year   = {2018}
}

Comments

6 pages. Submitted. This version reduces a claim from version 1, regarding the absoluteness of short-tree-iterability