Showing changes from revision #7 to #8:
Added | Removed | Changed
Whenever editing is allowed on the nLab again, this article should be ported over there.
A -complete lattice is a lattice with a function
such that denumerable/countable joins exist in the lattice:
A -complete lattice is a lattice with
a function
a family of dependent terms
a family of dependent terms
representing that denumerable/countable joins exist in the lattice.
Last revised on June 10, 2022 at 15:26:55. See the history of this page for a list of all contributions to it.