monoidal bicategories
Recently Published Documents


TOTAL DOCUMENTS

7
(FIVE YEARS 2)

H-INDEX

4
(FIVE YEARS 0)

2021 ◽  
pp. 513-574
Author(s):  
Niles Johnson ◽  
Donald Yau

In this chapter, further 2-dimensional categorical structures are presented and discussed. These include monoidal bicategories, as one-object tricategories, along with braided monoidal bicategories, sylleptic monoidal bicategories, and symmetric monoidal bicategories. The rest of the chapter discusses the Gray tensor product on 2-categories, Gray monoids, double categories, and monoidal double categories.


Author(s):  
Niles Johnson ◽  
Donald Yau

2-Dimensional Categories provides an introduction to 2-categories and bicategories, assuming only the most elementary aspects of category theory. A review of basic category theory is followed by a systematic discussion of 2-/bicategories; pasting diagrams; lax functors; 2-/bilimits; the Duskin nerve; the 2-nerve; internal adjunctions; monads in bicategories; 2-monads; biequivalences; the Bicategorical Yoneda Lemma; and the Coherence Theorem for bicategories. Grothendieck fibrations and the Grothendieck construction are discussed next, followed by tricategories, monoidal bicategories, the Gray tensor product, and double categories. Completely detailed proofs of several fundamental but hard-to-find results are presented for the first time. With exercises and plenty of motivation and explanation, this book is useful for both beginners and experts.


2012 ◽  
Vol 12 (1) ◽  
pp. 307-342 ◽  
Author(s):  
Angélica M Osorno

1998 ◽  
Vol 8 (2) ◽  
pp. 93-116 ◽  
Author(s):  
ROBERT ROSEBRUGH ◽  
N. SABADINI ◽  
R. F. C. WALTERS

The context of this article is the programme to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The objective here is to study reachability, minimization and minimal realization in these bicategories. In this setting the automata are 1-cells, in contrast with previous studies where they appeared as objects. As a consequence, we are able to study the relation of minimization and minimal realization to serial composition of automata using (co)lax (co)monads. We are led to define suitable behaviour categories and prove minimal realization theorems that extend classical results.


1997 ◽  
Vol 129 (1) ◽  
pp. 99-157 ◽  
Author(s):  
Brian Day ◽  
Ross Street

Sign in / Sign up

Export Citation Format

Share Document