Compactness and subsets of ordered sets that meet all maximal chains
The space \({\mathcal M}(P)\) of maximal chains of a chain complete ordered set P is studied. By \(P_ 1\) and \(P_ 2\) are denoted two particular ordered sets. A characterization of compactness of \({\mathcal M}(P)\) is as follows: \({\mathcal M}(P)\) is compact iff every nonempty open interval of P has a finite cutset and P contains no subset isomorphic to either of the ordered sets \(P_ 1\) or \(P_ 2\). It is proved that the space \({\mathcal M}(P)\) is compact if P satisfies any of the following conditions: (1) P contains no copy of \(P_ 1\) or \(P_ 2\) and for every \(x\in P\) there is a finite subset F of P which is coinitial above x. (2) P contains no proper N and for every \(x\in P\) there is a finite maximal antichain which contains x. (3) P contains no copy of \(P_ 1\) or its dual and all antichains in P are finite.
- Extensions of ordered sets having the finite cutset property
- Ladders in ordered sets
- Cutsets of Boolean lattices
- A chain decomposition theorem
- A maximal chain approach to topology and order
- Finite antichain cutsets in posets
- scientific article; zbMATH DE number 3957179 (Why is no real title available?)
- scientific article; zbMATH DE number 25351 (Why is no real title available?)
- Maximal chains in function spaces
- Une propriété des familles d'ensembles bien ordonnés linéaires
- An example Ginsburg said in 1984 he was ``unable to find and a forbidden subposet characterization of subsets of regular posets.
- Maximal chains in positive subfamilies of P( )
- On the treatment of incomparability in ordering semantics and premise semantics
This page was built for publication: Compactness and subsets of ordered sets that meet all maximal chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760448)
