Editing Glossary of order theory (section)

== B ==

* '''Base'''. See ''continuous poset''.
* '''[[Binary relation]]'''. A binary relation over two sets <math>X \text{ and } Y</math> is a subset of their [[Cartesian product]] <math>X \times Y.</math>
* '''[[Boolean algebra (structure)|Boolean algebra]]'''. A Boolean algebra is a distributive lattice with least element 0 and greatest element 1, in which every element ''x'' has a complement ¬''x'', such that ''x'' &and; ¬''x'' = 0 and ''x'' &or; ¬''x'' = 1.
* '''[[Bounded poset]]'''. A [[Bounded poset|bounded]] poset is one that has a least element and a greatest element.
* '''[[Bounded complete]]'''. A poset is [[bounded complete]] if every of its subsets with some upper bound also has a least such upper bound. The dual notion is not common.