𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Order-Convergence in Posets

✍ Scribed by Isidore Fleischer

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
269 KB
Volume
142
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

First order properties of random posets
First order properties of random posets
✍ Tomasz Łuczak πŸ“‚ Article πŸ“… 1991 πŸ› Springer Netherlands 🌐 English βš– 397 KB

Let LB = s2(n, p) be a binary relation on the set [n] = { 1, ?, , n} such that Se(i, i) for every i and W(i,j) with probability p, independently for each pair i, j E [n], where i <j. Define < as the transitive closure of W and denote poset ([n], <) by R(n, p). We show that for any constant p probabi

The ANTI-order for caccc posets β€” part I
The ANTI-order for caccc posets β€” part I
✍ Boyu Li πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 860 KB

This paper deals with a generalization of the following simple observation. Suppose there are distinct elements a, b of the chain complete poset (P, <) such that P( < a) C P( < b) and P( > a) L P( > h); if P( < a) and P( > a) are both fixed point free (fpf), then P is also fpf (we say P is trivially

The ANTI-order for caccc posets β€” Part I
The ANTI-order for caccc posets β€” Part II
✍ Boyu Li πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 957 KB

In Part I we defined the ANTI-order, ANTI-good subsets, ANTI-perfect sequences and ANTIcores for caccc posets. In this part we prove the main result: If n = (P. : < < 2.) is an ANTIperfect sequence of a connected caccc poset P which dots not contain a one-way infinite fence, then PC is a retract of