The word problem for double categories

07/23/2019
by   Antonin Delpeuch, et al.
0

We solve the word problem for double categories by translating it to the word problem for 2-categories. This yields a quadratic algorithm deciding the equality of diagrams in a free double category. The translation is of interest in its own right since and can for instance be used to reason about double categories with the language of 2-categories, sidestepping the pinwheel problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/16/2022

Promonads and String Diagrams for Effectful Categories

Premonoidal and Freyd categories are both generalized by non-cartesian F...
research
11/02/2021

Double pushout rewriting of C-sets

We generalize a pushout complement algorithm from graph rewriting to fin...
research
05/26/2023

Protocol Choice and Iteration for the Free Cornering

We extend the free cornering of a symmetric monoidal category, a double ...
research
04/12/2023

Filler Word Detection with Hard Category Mining and Inter-Category Focal Loss

Filler words like “um" or “uh" are common in spontaneous speech. It is d...
research
04/08/2022

String Diagram Rewriting Modulo Commutative Monoid Structure

We characterise freely generated props with a chosen commutative monoid ...
research
10/30/2020

The matrix taxonomy of left exact categories

This paper is concerned with the problem of classifying left exact categ...
research
11/06/2018

WordNet-feelings: A linguistic categorisation of human feelings

In this article, we present the first in depth linguistic study of human...

Please sign up or login with your details

Forgot password? Click here to reset