Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T13:13:03.872Z Has data issue: false hasContentIssue false

A weak Dodd-Jensen lemma

Published online by Cambridge University Press:  12 March 2014

Itay Neeman
Affiliation:
Harvard University, Department of Mathematics, 1 Oxford St. Cambridge, MA 02138, E-mail: ineeman@math.harvard.edu
John Steel
Affiliation:
University of California -Berkeley, Department of Mathematics, Berkeley, CA 94720-3840, E-mail: steel@math.berkeley.edu

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable