Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 44 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 13 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 208 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

A Synthetic Perspective on $(\infty,1)$-Category Theory: Fibrational and Semantic Aspects (2202.13132v1)

Published 26 Feb 2022 in math.CT, cs.LO, math.AT, and math.LO

Abstract: Reasoning about weak higher categorical structures constitutes a challenging task, even to the experts. One principal reason is that the language of set theory is not invariant under the weaker notions of equivalence at play, such as homotopy equivalence. From this point of view, it is natural to ask for a different foundational setting which more natively supports these notions. Our work takes up on suggestions in the original article arXiv:1705.07442 by Riehl--Shulman to further develop synthetic $(\infty,1)$-category theory in simplicial homotopy type theory, including in particular the study of cocartesian fibrations. Together with a collection of analytic results, notably due to Riehl--Verity and Rasekh, it follows that our type-theoretic account constitutes a synthetic theory of fibrations of internal $(\infty,1)$-categories, w.r.t. to an arbitrary Grothendieck--Rezk--Lurie-$(\infty,1)$-topos via Shulman's major result arXiv:1904.07004 about strictification of univalent universes.

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)