2000 character limit reached
Univalence in Simplicial Sets (1203.2553v4)
Published 12 Mar 2012 in math.AT and math.CT
Abstract: We present an accessible account of Voevodsky's construction of a univalent universe of Kan fibrations.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.