Every poset that is a complete semilattice must always be a                

Related MCQs

• If every two elements of a poset are comparable then the poset is called                  
• A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as                
• A free semilattice has the                 property.
• In a get-together party, every person present shakes the hand of every other person. If there were 90 handshakes in all, how many persons were present at the party?
• Every Isomorphic graph must have                  representation.
• During a month with 30 days, a cricket team plays at least one game a day, but no more than 45 games. There must be a period of some number of consecutive days during which the team must play exactly               number of games.
• A complete n-node graph Kn is planar if and only if                            
• The inclusion of              sets into R = {{1, 2}, {1, 2, 3}, {1, 3, 5}, {1, 2, 4}, {1, 2, 3, 4, 5}} is necessary and sufficient to make R a complete lattice under the partial order defined by set containment.
• The set for which the Boolean function is functionally complete is                      
• The total number of edges in a complete graph of n vertices is _________.