JSYML
2010
13 years 7 months ago
2010
It is shown that under GCH every poset preserves its cofinality in any cofinality preserving extension. On the other hand, starting with measurable cardinals, a model with a part...
MST
2011
13 years 7 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
ORDER
2008
14 years 11 days ago
2008
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
CORR
2007
Springer
14 years 12 days ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
DM
2008
14 years 15 days ago
2008
Let m 2 be an integer. We say that a poset P = (X, ) is m-partite if X has a partition X = X1