نتایج جستجو برای: directed complete partially ordered set
تعداد نتایج: 1263669 فیلتر نتایج به سال:
Partially ordered sets are investigated from the point of view of Bishop’s constructive mathematics. Unlike the classical case, one cannot prove constructively that every nonempty bounded above set of real numbers has a supremum. However, the order completeness of R is expressed constructively by an equivalent condition for the existence of the supremum, a condition of (upper) order locatedness...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...
Let P = {pi|i = 1, 2, . . . , n} be a set of n elements with partial order defined as follows: pi ≤ pj if and only if i divides j. Assume real numbers are assigned to all members of P in an order preserving manner, this results in a set A of n real numbers. Given an unknown x ∈ R, we want to determine whether x is belong to A or not, by comparing x with as few elements of A as possible. We pres...
A well known theorem of Cantor asserts that the cardinal of the power-set of a given set always exceeds the cardinal of the original set. An analogous result for sets having additional structure is the well known theorem that the set of initial segments of a well ordered set always has order type greater than the original set. These two theorems suggest that there should be a similar result for...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید