Name
Abstract | ||
|---|---|---|
This paper discusses two combinatorial problems in stability theory. First we prove a partition result for subsets of stable models: for any A and B, we can partition A into \B \ (< kappa (T)) pieces, <A(i) \ i < \B \ (< kappa (T))>, such that for each A(i) there is a B-i subset of or equal to B where \B-i\ < kappa (T) and A(i) down arrow (Bi) B. Second, if A and B are as above and \A \ > \B \, then we try to find A' subset of A and B' subset of B such that \A'\ is as large as possible, \B'\ is as small as possible, and A' down arrow (B') B. we prove some positive results in this direction, and we discuss the optimality of these results under (B')ZFC + GCH. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.2307/2694983 | JOURNAL OF SYMBOLIC LOGIC |
DocType | Volume | Issue |
Journal | 66 | 4 |
ISSN | Citations | PageRank |
0022-4812 | 0 | 0.34 |
References | Authors | |
0 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Timothy Bays | 1 | 0 | 0.34 |