A weak Dodd-Jensen lemma

Journal of Symbolic Logic 64 (3):1285-1294 (1999)
  Copy   BIBTEX

Abstract

We show that every sufficiently iterable countable mouse has a unique iteration strategy whose associated iteration maps are lexicographically minimal. This enables us to extend the results of [3] on the good behavior of the standard parameter from tame mice to arbitrary mice

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
65 (#256,004)

6 months
8 (#415,230)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Characterization of □κin core models.Ernest Schimmerling & Martin Zeman - 2004 - Journal of Mathematical Logic 4 (01):1-72.
Inner models in the region of a Woodin limit of Woodin cardinals.Itay Neeman - 2002 - Annals of Pure and Applied Logic 116 (1-3):67-155.
Iterability for (transfinite) stacks.Farmer Schlutzenberg - 2021 - Journal of Mathematical Logic 21 (2):2150008.
Equiconsistencies at subcompact cardinals.Itay Neeman & John Steel - 2016 - Archive for Mathematical Logic 55 (1-2):207-238.
Dodd parameters and λ-indexing of extenders.Martin Zeman - 2004 - Journal of Mathematical Logic 4 (01):73-108.

View all 7 citations / Add more citations

References found in this work

Inner models with many Woodin cardinals.J. R. Steel - 1993 - Annals of Pure and Applied Logic 65 (2):185-209.

Add more references