Homotopy Type Theory
decidable setoid > history (Rev #6, changes)
Showing changes from revision #5 to #6:
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
Revision on June 15, 2022 at 20:39:46 by
Anonymous?.
See the history of this page for a list of all contributions to it.