Showing changes from revision #1 to #2:
Added | Removed | Changed
A $\omega$-complete poset or countably cocomplete (0,1)-category is a poset $(P, \leq)$ with
a term $\bot:P$
a family of dependent terms
representing that $\bot$ is initial in the poset.
a function
a family of dependent terms
a family of dependent terms
representing that denumerable/countable joins exist in the poset.
Last revised on June 9, 2022 at 23:16:03. See the history of this page for a list of all contributions to it.