A long pseudo-comparison of premice in
arXiv:1510.01724 · doi:10.1215/00294527-2018-0012
Abstract
We describe an obstacle to the analysis of as a core model: Assuming sufficient large cardinals, for a Turing cone of reals there are premice in such that the pseudo-comparison of with succeeds, is computed in , and lasts through stages. Moreover, we can take where is the minimal iterable proper class inner model with a Woodin cardinal, and is that Woodin. We can take such that is -like and short-tree-iterable.
arXiv comment6 pages. Submitted. This version reduces a claim from version 1, regarding the absoluteness of short-tree-iterability