agda-unimath
agda-unimath copied to clipboard
Open claims for partitions of finite types
The following claims remain to be formalized in univalent-combinatorics.partitions:
- [ ] The type of finite partitions of a finite type
Xis equivalent to the type of decidable partitions ofXin the usual sense - [ ] The type of finite partitions of a finite type
Xis equivalent to the type of equivalence relations onX - [ ] The type of finite partitions of a finite type is finite
- [ ] The number of elements of the type of finite partitions of a finite type is a Stirling number of the second kind
- [ ] The type of finite partitions of a contractible type is contractible