Homotopy Type Theory
decidable setoid > history (Rev #5, changes)
Showing changes from revision #4 to #5:
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 April 28, 2022 at 19:43:21 by
Anonymous?.
See the history of this page for a list of all contributions to it.