- {s| e1,...,en |t} |-> e1 *_st ... *_st en : T(s) -> T(t)
- {s||s} |-> id: T(s) -> T(s)
Note, that independently of whether an interpretation like this can be made to go through, the previous notions raise a very interesting question for infinitary compositions of morphisms. What is a good language for describing such? Can a comprehension notation serve that purpose?
Oh, and the nesting... could these be cells? i'm not sure, yet. To make the cell interpretation work it would seem that cell degree (0-cell, 1-cell, 2-cell, ... ) is not a fixed thing because of phenomena like
- {s| ..., {u| ..., {s| ... |t}, ... |v}, ... |t}
1 comment:
A categories list participant emailed me with the suggestion that limits might provide a language for infinitary compositions. Limits, however, do not always exist, while the infinitary compositions will. They capture different notions.
Post a Comment