solidot新版网站常见问题,请点击这里查看。

A formal language for cyclic operads. (arXiv:1602.07502v2 [math.AT] UPDATED)

来源于:arXiv
We propose a $\lambda$-calculus-style formal language, called the $\mu$-syntax, as a lightweight representation of the structure of cyclic operads. We illustrate the rewriting methods behind the formalism by giving a complete step-by-step proof of the equivalence between the unbiased and biased definitions of cyclic operads. 查看全文>>