-
Notifications
You must be signed in to change notification settings - Fork 12
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.
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
Hedberg #245
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Wonderful!!
k | ||
| i=1 ⇒ λ _ → q j | ||
| j=0 ⇒ λ k → connection/or A (cap 0) i k | ||
| j=1 ⇒ λ k → connection/or A (cap 1) i k |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
One thing to consider if you take partial elements seriously would be to allow sharing of branches in systems. That way the two last cases could be written:
| j=0 \/ j=1 ⇒ λ k → connection/or A (cap j) i k
This happens quite often and it might help with memory consumption.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
That'd be so cool! Let's talk about it at dagstuhl.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think i see how to make that work...
Looks good to me! Two minor results that would be easy to add is that |
Done! |
nat
andint
are sets using Hedberg's theorem (resolves Z is a set #207)The proof of Hedberg is different from the one in cubicaltt, though the idea is the same. I did use some connections, so there may be a more efficient way.