It was proved in Li and Milner (t996) that for a connected caccc poset which does not contain a one-way infinite fence, any two ANTI-perfect sequences have the same length and any two ANTI-cores are isomorphic. In the present paper we give a new proof of this result under the weaker assumption that
Isomorphic ANTI-cores of caccc posets
โ Scribed by Boyu Li; E.C. Milner
- Book ID
- 104113795
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 562 KB
- Volume
- 176
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper is a continuation of [1]. We show that, for a connected caccc poset having no one-way infinite fence any two ANTI-perfect sequences have the same length and any two ANTI-cores are isomorphic.
๐ SIMILAR VOLUMES
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
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
This paper settles a conjecture made in (Li [2]) that, if (PC: ~ ~< 2) is an ANTI-perfect sequence in a connected caccc poset having no one-way infinite fence, then either there are ~ < 2 and x e Pe\~+l such that Pc(> x) and P~(<x) are both fixed point free (fpf), in which case P is also fpf, or P h