Comparison of fine structural mice via coarse iteration
Logic
2014-11-27 v2
Abstract
Let M be a fine structural mouse. Let D be a fully backgrounded L[E]-construction computed inside an iterable coarse premouse S. We describe a process comparing M with D, through forming iteration trees on M and on S. We then prove that this process succeeds.
Cite
@article{arxiv.1309.6363,
title = {Comparison of fine structural mice via coarse iteration},
author = {Farmer Schlutzenberg and John R. Steel},
journal= {arXiv preprint arXiv:1309.6363},
year = {2014}
}