Name
Abstract | ||
|---|---|---|
We consider the existence of coherent families of finite-to-one functions on countable subsets of an uncountable cardinal kappa. The existence of such families for kappa implies the existence of a winning 2-tactic for player TWO in the countable-finite game on kappa. We prove that coherent families exist on kappa = omega(n), where n is-an-element-of omega, and that they consistently exist for every cardinal kappa. We also prove that iterations of Axiom A forcings with countable supports are Axiom A. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.2307/2275329 | JOURNAL OF SYMBOLIC LOGIC |
DocType | Volume | Issue |
Journal | 58 | 1 |
ISSN | Citations | PageRank |
0022-4812 | 3 | 0.54 |
References | Authors | |
1 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Piotr Koszmider | 1 | 6 | 1.79 |