A Weak Dodd-Jensen Lemma

Neeman, Itay; Steel, John

J. Symbolic Logic, Tome 64 (1999) no. 1, p. 1285-1294 / Harvested from Project Euclid

Résumé

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.

Publié le : 1999-09-14
Classification:

@article{1183745881,
     author = {Neeman, Itay and Steel, John},
     title = {A Weak Dodd-Jensen Lemma},
     journal = {J. Symbolic Logic},
     volume = {64},
     number = {1},
     year = {1999},
     pages = { 1285-1294},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745881}
}

Neeman, Itay; Steel, John. A Weak Dodd-Jensen Lemma. J. Symbolic Logic, Tome 64 (1999) no. 1, pp.  1285-1294. http://gdmltest.u-ga.fr/item/1183745881/