Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Comparison of fine structural mice via coarse iteration

Comparison of fine structural mice via coarse iteration Let $${\mathcal{M}}$$ M be a fine structural mouse. Let $${\mathbb{D}}$$ D be a fully backgrounded $${L[\mathbb{E}]}$$ L [ E ] -construction computed inside an iterable coarse premouse S. We describe a process comparing $${\mathcal{M}}$$ M with $${\mathbb{D}}$$ D , through forming iteration trees on $${\mathcal{M}}$$ M and on S. We then prove that this process succeeds. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

Comparison of fine structural mice via coarse iteration

Archive for Mathematical Logic , Volume 53 (6) – Apr 30, 2014

Loading next page...
 
/lp/springer-journals/comparison-of-fine-structural-mice-via-coarse-iteration-wgb9Sd002N

References (7)

Publisher
Springer Journals
Copyright
Copyright © 2014 by Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/s00153-014-0379-6
Publisher site
See Article on Publisher Site

Abstract

Let $${\mathcal{M}}$$ M be a fine structural mouse. Let $${\mathbb{D}}$$ D be a fully backgrounded $${L[\mathbb{E}]}$$ L [ E ] -construction computed inside an iterable coarse premouse S. We describe a process comparing $${\mathcal{M}}$$ M with $${\mathbb{D}}$$ D , through forming iteration trees on $${\mathcal{M}}$$ M and on S. We then prove that this process succeeds.

Journal

Archive for Mathematical LogicSpringer Journals

Published: Apr 30, 2014

There are no references for this article.