2020/03/20 by Filippo Bonchi, Bonchi, Filippo, Jens Seeber +4
Computer Science · Mathematics · #Advanced Algebra and Logic #Category Theory (math.CT) #FOS: Computer and information sciences #FOS: Mathematics #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.LO #math.CT
paper · pdf · doi:10.48550/arxiv.2003.09453
arxiv created 2020/03/20 · openalex publication_date 2020/03/20 · arxiv updated 2020/03/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.