加载中…
We define a class of morphisms between strict -categories called discrete Conduch{'e} -functors that generalize discrete Conduch{'e} functors between 1-categories and we study their properties related to polygraphs. The main result we prove is that for every discrete Conduch{'e} -functor, if its target is a free strict -category on a polygraph then so is its source.

生成讲解博客的中文版本

生成AI智能校验的中文版本