Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

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

Open
1 task
fredrik-bakke opened this issue Sep 10, 2023 · 0 comments
Open
1 task

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

fredrik-bakke opened this issue Sep 10, 2023 · 0 comments
Labels
good first issue Good for newcomers univalent-combinatorics

Comments

@fredrik-bakke
Copy link
Collaborator

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 added a commit to fredrik-bakke/agda-unimath that referenced this issue Sep 10, 2023
@fredrik-bakke
UniMath#745
476516b
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
good first issue Good for newcomers univalent-combinatorics
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@fredrik-bakke