2006/07/18 by Miles Gould, Gould, Miles
Computer Science · Mathematics · #AI-based Problem Solving and Planning #Category Theory (math.CT) #Constraint Satisfaction and Optimization #FOS: Mathematics #math.CT
paper · pdf · doi:10.48550/arxiv.math/0607423
13 pages, 1 figure. Presented at 82nd PSSL, Glasgow, May 2006
arxiv created 2006/07/18 · openalex publication_date 2006/07/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It has long been known that every weak monoidal category A is equivalent via monoidal functors and monoidal natural transformations to a strict monoidal category st(A). We generalise the definition of weak monoidal category to give a definition of weak P-category for any strongly regular (operadic) theory P, and show that every weak P-category is equivalent via P-functors and P-transformations to a strict P-category. This strictification functor is then shown to have an interesting universal property.