nLab sigma-complete Boolean algebra

Contents

Idea

A σ\sigma-complete Boolean algebra is a Boolean algebra which is also a σ \sigma -complete lattice; that is, it is a poset with countable limits and colimits that is also cartesian closed and satisfies the law of excluded middle.

 Examples

Last revised on August 28, 2024 at 11:43:56. See the history of this page for a list of all contributions to it.