Papers
Topics
Authors
Recent
Search
2000 character limit reached

Univalence in Simplicial Sets

Published 12 Mar 2012 in math.AT and math.CT | (1203.2553v4)

Abstract: We present an accessible account of Voevodsky's construction of a univalent universe of Kan fibrations.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.