Homotopy Type Theory
decidable setoid > history (changes)
Showing changes from revision #7 to #8:
Added | Removed | Changed
Contents
Definition
A decidable setoid is a type with a function and terms
A decidable set is a decidable setoid where the canonical dependent functions
are equivalences.
See also
Last revised on June 18, 2022 at 21:58:13.
See the history of this page for a list of all contributions to it.