Fetching the paper…

Reading the bibliography…

2012

A direct proof that the category of 3-computads is not cartesian closed

Cheng, Eugenia

Original
PDF
Post on X

Understand

We prove by counterexample that the category of 3-computads is not cartesian closed, a result originally proved by Makkai and Zawadowski.

We give a 3-computad B and show that the functor _ x B does not have a right adjoint, by giving a coequaliser that is not preserved by it.

A direct proof that the category of 3-computads is not cartesian closed · Around

Built on

Enriched Tannaka reconstruction
Brian Day · 1969
Earlier work this paper cites.
Limits indexed by category valued 2-functors
Ross Street · 1976
Earlier work this paper cites.
Higher-dimensional word problems with applications to equational logic
A. Burroni · 1993
Earlier work this paper cites.

Similar

Connected limits, familial representability and Artin glueing
Aurelio Carboni and Peter Johnstone · 1995
Cited alongside, same era.
Computads for finitary monads on globular sets
M. A. Batanin · 1998
Cited alongside, same era.
Corrigenda for “Connected limits, familial representability and Artin glueing”
Aurelio Carboni and Peter Johnstone · 2004
Cited alongside, same era.

Then

3-computads do not form a presheaf category
Michael Makkai and Marek Zawadowski · 2008
Later among the works it cites.
A note on Penon’s definition of weak n n -category
Eugenia Cheng and Michael Makkai · 2009
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…