Abstract: "In order to facilitate the study of 2-categories with structure, we state and prove an n-categorical pasting theorem. This is based upon a new definition of n-pasting scheme that generalises Johnson's definition of a well-formed loop-free pasting scheme by weakening his no direc...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Power, Anthony John (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Edinburgh 1991
Schriftenreihe:	Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 190
Schlagworte:	Computer software Mathematics Mathematik Categories (Mathematics)
Zusammenfassung:	Abstract: "In order to facilitate the study of 2-categories with structure, we state and prove an n-categorical pasting theorem. This is based upon a new definition of n-pasting scheme that generalises Johnson's definition of a well-formed loop-free pasting scheme by weakening his no direct loops condition. We define n-pasting, prove the theorem, and show that for n=3, it incorporates all possible composites of n-cells. We show that that is not true for higher n. We define the horizontal n-category of an (n+1)-category to generalise that of a 2-category, we define horizontal and vertical composition for an (n+1)-category and we state and prove an interchange law We also study further conditions on a pasting diagram and their impact upon how one may evaluate a composite, and we express Street's free n-categories in terms of left adjoints.
Beschreibung:	42 S.