agda-unimath icon indicating copy to clipboard operation
agda-unimath copied to clipboard

Published 20 hours ago • verified publisher icon UniMath

Show that the number of decidable equivalence relations on a finite type is a Stirling number of the second kind

Open fredrik-bakke opened this issue 2 years ago • 0 comments

The following is waiting to be formalized in univalent-combinatorics.decidable-equivalence-relations:

  • [ ] The number of decidable equivalence relations on a finite type is a Stirling number of the second kind

fredrik-bakke avatar Sep 10 '23 18:09 fredrik-bakke