Page "Complete Boolean algebra" Paragraph 14
from
Wikipedia
* Every subset of a complete Boolean algebra has a supremum, by definition ; it follows that every subset also has an infimum ( greatest lower bound ).
Page 1 of 1.
1.823 seconds.