Computads for weak \(\omega \)-categories as an inductive type
From MaRDI portal
Publication:6562849
DOI10.1016/J.AIM.2024.109739zbMATH Open1541.1803MaRDI QIDQ6562849
David Reutter, Ioannis Markakis, Christopher J. Dean, Eric Finster, Jamie Vicary
Publication date: 27 June 2024
Published in: Advances in Mathematics (Search for Journal in Brave)
Strict omega-categories, computads, polygraphs (18N30) Tricategories, weak (n)-categories, coherence, semi-strictification (18N20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monads with arities and their associated theories
- Higher-dimensional word problems with applications to equational logic
- A cellular nerve for higher categories
- The category of 3-computads is not cartesian closed
- Homomorphisms of higher categories
- Polygraphic resolutions and homology of monoids
- The algebra of oriented simplexes
- Are colimits of algebras simple to construct?
- Limits indexed by category-valued 2-functors
- Monoidal globular categories as a natural environment for the theory of weak \(n\)-categories
- Wellfounded trees in categories
- Types and programing languages
- A direct proof that the category of 3-computads is not Cartesian closed
- Connected limits, familial representability and Artin glueing
- Polynomial functors and polynomial monads
- A Type-Theoretical Definition of Weak {\omega}-Categories
- Non-unital polygraphs form a presheaf category
- Towards 3-Dimensional Rewriting Theory
- Homotopy Type Theory: Univalent Foundations of Mathematics
- Understanding the small object argument
This page was built for publication: Computads for weak \(\omega \)-categories as an inductive type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562849)
