Showing changes from revision #2 to #3:
Added | Removed | Changed
A meet-semilattice or finitely complete (0,1)-category is a poset or (0,1)-category with
a term
a family of dependent terms
representing that is terminal in the poset.
a binary operation
two families of dependent terms
a family of dependent terms
representing that is a product in the poset.
If is only a (0,1)-precategory, then it is called a finitely complete (0,1)-precategory
Last revised on June 10, 2022 at 16:37:49. See the history of this page for a list of all contributions to it.