basic constructions:
strong axioms
further
With braiding
With duals for objects
category with duals (list of them)
dualizable object (what they have)
ribbon category, a.k.a. tortile category
With duals for morphisms
monoidal dagger-category?
With traces
Closed structure
Special sorts of products
Semisimplicity
Morphisms
Internal monoids
Examples
Theorems
In higher category theory
A kind of linear logic in which the exponential modality is indexed by, say, the natural numbers to indicate the availability of the number of copies of a premise.
Jean-Yves Girard, Andre Scedrov, Philip J. Scott, Bounded linear logic: a modular approach to polynomial-time computability, Theoretical Computer Science Volume 97, Issue 1, 20 April 1992, Pages 1-66 (doi:10.1016/0304-3975(92)90386-T)
Ugo Dal Lago, Martin Hofmann, Bounded Linear Logic, Revisited, Logical Methods in Computer Science, Volume 6, Issue 4 (December 18, 2010) lmcs:1064 (arXiv:0904.2675)
Bounded Linear Logic Workshop, Fontainebleau, 2-4 December 2013, (webpage)
Last revised on August 25, 2022 at 14:14:51. See the history of this page for a list of all contributions to it.