Computads for weak -categories as an inductive type

DOI10.1016/J.AIM.2024.109739MaRDI QIDQ6562849zbMATH OpenFDO

Authors Christopher J. Dean, Eric Finster, Ioannis Markakis, David Reutter, Jamie Vicary

Publication date 27 June 2024

Published in Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

higher categoriesinductive typescomputads

Mathematics Subject Classification ID

Strict omega-categories, computads, polygraphs (18N30) Tricategories, weak (n)-categories, coherence, semi-strictification (18N20)

Recommendations

• scientific article; zbMATH DE number 1303765
• Computads for generalised signatures
• Omega-categories and chain complexes
• The category of 3-computads is not cartesian closed
• Duality for simple \(\omega\)-categories and disks

Cites work

• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 2125667 (Why is no real title available?)
• scientific article; zbMATH DE number 2134022 (Why is no real title available?)
• scientific article; zbMATH DE number 3458870 (Why is no real title available?)
• scientific article; zbMATH DE number 1303765 (Why is no real title available?)
• scientific article; zbMATH DE number 575948 (Why is no real title available?)
• A Type-Theoretical Definition of Weak {\omega}-Categories
• A cellular nerve for higher categories
• A direct proof that the category of 3-computads is not Cartesian closed
• Are colimits of algebras simple to construct?
• Connected limits, familial representability and Artin glueing
• Higher-dimensional word problems with applications to equational logic
• Homomorphisms of higher categories
• Homotopy type theory. Univalent foundations of mathematics
• Limits indexed by category-valued 2-functors
• Monads with arities and their associated theories
• Monoidal globular categories as a natural environment for the theory of weak \(n\)-categories
• Non-unital polygraphs form a presheaf category
• Polygraphic resolutions and homology of monoids
• Polynomial functors and polynomial monads
• The algebra of oriented simplexes
• The category of 3-computads is not cartesian closed
• Towards 3-dimensional rewriting theory
• Types and programing languages
• Understanding the small object argument
• Wellfounded trees in categories

Cited in

(1)

• Computads for generalised signatures

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)