A long pseudo-comparison of premice in $L[x]$
Logic
2018-11-14 v2
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.
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