The strict case has been studied quite a bit using n-polygraphs (aka computads), which give a way of presenting an n-category by generators and relations (where relations are given by n+1 dimensional cells). Often the concern is decidablility of the (higher-dimensional) word problem, using rewriting. They originally came out of work by Street and Burroni. More recently, Yves Guiraud has written about them quite extensively. See e.g.: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.144.3106&rep=rep1&type=pdf Best, Aleks Kissinger On 2 August 2013 17:35, Mike Stay <metaweta@gmail.com> wrote:
Has anyone worked out the details of "higher Lawvere theories" so that one can say "the free bicategory on this object, these morphisms, these 2-morphisms, modulo these equations of 2-morphisms"? -- Mike Stay - metaweta@gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com
[For admin and other information see: http://www.mta.ca/~cat-dist/ ]