poset การใช้

• Finally, every subcategory of a poset is isomorphism-closed.
• Indeed, the word length makes this into a graded poset.
• The underlying poset of a Boolean algebra always forms a lattice.
• Also, every preordered set is equivalent to a poset.
• Every poset that is a complete semilattice is also a complete lattice.
• One may also consider the subsets of a poset which are chains.
• The poset may be represented in a Hasse diagram.
• Let G be a generic filter for this poset.
• In some cases, however, the base for a poset is countable.
• The first diagram makes clear that the power set is a graded poset.
• The seldom considered dual notion of a dcpo is the filtered complete poset.
• In general, the poset of regions is M鯾ius function has been computed.
• The \ Delta-lemma is a forcing poset.
• A poset in which every two elements are incomparable is called an antichain.
• Any such poset has a dual poset.
• Any such poset has a dual poset.
• The incidence poset of an undirected graph with height 2 that has as its elements.
• This poset satisfies the countable chain condition.
• This number may be used to describe the optimal game play in a poset game.
• The Hasse diagram defines the unique poset and therefore fully captures the structure of the polytope.