Showing changes from revision #2 to #3:
Added | ~~Removed~~ | ~~Chan~~ged

category: redirected to nlab

A **decidable directed graph** is a type $T$ with a function $(-) \to (-):T \times T \to \mathbb{2}$.

- booleans
- decidable setoid
- decidable preordered type
- decidable strict order
- decidable dense strict order?

category: not redirected to nlab yet

Last revised on June 18, 2022 at 21:59:49. See the history of this page for a list of all contributions to it.