Cartesian bicategories with choice

03/20/2020
by   Filippo Bonchi, et al.
0

Relational structures are emerging as ubiquitous mathematical machinery in the semantics of open systems of various kinds. Cartesian bicategories are a well-known categorical algebra of relations that has proved especially useful in recent applications. The passage between a category and its bicategory of relations is an important question that has been widely studied for decades. We study an alternative construction that yields a cartesian bicategory of relations. Its behaviour is closely related to the axiom of choice, which itself can be expressed in the language of cartesian bicategories.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/23/2017

Functorial Semantics for Relational Theories

We introduce the concept of Frobenius theory as a generalisation of Lawv...
04/08/2019

On matrices and K-relations

We show that the matrix query language MATLANG corresponds to a natural ...
04/10/2018

Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics

Type-and-effect systems incorporate information about the computational ...
10/20/2020

A canonical algebra of open transition systems

Feedback and state are closely interrelated concepts. Categories with fe...
04/20/2018

Choice Revision

Choice revision is a sort of non-prioritized multiple belief revision, i...
01/03/2017

Ambiguity and Incomplete Information in Categorical Models of Language

We investigate notions of ambiguity and partial information in categoric...
02/06/2020

Relating Apartness and Bisimulation

A bisimulation for a coalgebra of a functor on the category of sets can ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.