2009•Electronic Notes in Theoretical Computer ScienceOpen access

Monoidal Indeterminates and Categories of Possible Worlds

Claudio Hermida, Robert D. Tennent

Open full text 2 citations

Abstract

Given any symmetric monoidal category C, a small symmetric monoidal category Σ and a strong monoidal functor j:Σ→C, it is shown how to construct C[x:jΣ], a polynomial such category, the result of freely adjoining to C a system x of monoidal indeterminates for every object j(w) with w∈Σ satisfying a naturality constraint with the arrows of Σ. As a special case, we show how to construct the free co-affine category (symmetric monoidal category with initial unit) on a given small symmetric monoidal category. It is then shown that all the known categories of “possible worlds” used to treat languages that allow for dynamic creation of “new” variables, locations, or names are in fact instances of this construction and hence have appropriate universality properties.

Open-access reader

About this research paper

What this paper is about

Given any symmetric monoidal category C, a small symmetric monoidal category Σ and a strong monoidal functor j:Σ→C, it is shown how to construct C[x:jΣ], a polynomial such category, the result of freely adjoining to C a system x of monoidal indeterminates for every object j(w) with w∈Σ satisfying a naturality constraint with the arrows of Σ. As a special case, we show how to construct the free co-affine category (symmetric monoidal category with initial unit) on a given small symmetric monoidal category. It is then shown that all the known categories of “possible worlds” used to treat languages that allow for dynamic creation of “new” variables, locations, or names are in fact instances of this construction and hence have appropriate universality properties.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Given any symmetric monoidal category C, a small symmetric monoidal category Σ and a strong monoidal functor j:Σ→C, it is shown how to construct C[x:jΣ], a polynomial such category, the result of freely adjoining to C a system x of monoidal indeterminates for every object j(w) with w∈Σ satisfying a naturality constraint with the arrows of Σ. As a special case, we show how to construct the free co-affine category (symmetric monoidal category with initial unit) on a given small symmetric monoidal category. It is then shown that all the known categories of “possible worlds” used to treat languages that allow for dynamic creation of “new” variables, locations, or names are in fact instances of this construction and hence have appropriate universality properties.

Key concepts: Enriched category, Symmetric monoidal category, Closed monoidal category, Functor, Mathematics, Higher category theory, Monoidal category, Closed category

Related papers

Back to paper searchBrowse research topicsOriginal source
Monoidal Indeterminates and Categories of Possible Worlds — Research Paper | ScholarLens