The combinatorics of n-categorical pasting (Q909013): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 17:56, 30 January 2024

scientific article
Language Label Description Also known as
English
The combinatorics of n-categorical pasting
scientific article

    Statements

    The combinatorics of n-categorical pasting (English)
    0 references
    0 references
    1989
    0 references
    Pasting 2-cells in a diagram is a somehow obvious process on any simple concrete example you have in mind. When the diagram gets complicated and various horizontal and vertical compositions are mixed, you rapidly give up and write ``One proves easily that this defines a composite cell...'' Amazingly enough, the metatheorem everybody had in mind about pasting 2- cells was never proved before this paper, even if the attempts to do so were numerous. The present paper should therefore be considered as a central one in 2- category theory and even, more generally, in n-category theory, since this is the context in which the pasting theorem is proved. The paper is moreover very nicely written. It should be read by anybody using 2- categories.
    0 references
    0 references
    pasting 2-cells
    0 references
    2-category theory
    0 references
    n-category theory
    0 references