Comparison of fine structural mice via coarse iteration

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.

References in corpus (1)

• Measures in Mice

Cited by in corpus (2)

• Ordinal definability in $L[\mathbb{E}]$
• Negative results on precipitous ideals on omega_1