English
Related papers

Related papers: When Lawvere meets Peirce: an equational presentat…

200 papers

We study the relationship between cartesian bicategories and a specialisation of Lawvere's hyperdoctrines, namely elementary existential doctrines. Both provide different ways of abstracting the structural properties of logical systems: the…

Logic in Computer Science · Computer Science 2021-11-09 Filippo Bonchi , Alessio Santamaria , Jens Seeber , Paweł Sobociński

We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the calculus of binary relations that has the same expressivity as first order logic and comes with a complete axiomatisation. The axioms are obtained…

Logic in Computer Science · Computer Science 2024-01-17 Filippo Bonchi , Alessandro Di Giorgio , Nathan Haydon , Pawel Sobocinski

Regular logic is the fragment of first order logic generated by $=$, $\top$, $\wedge$, and $\exists$. A key feature of this logic is that it is the minimal fragment required to express composition of binary relations; another is that it is…

Category Theory · Mathematics 2019-09-04 Brendan Fong , David I Spivak

We make explicit the correspondence between syntax and syntactic categories for coherent first-order logic, providing a categorical characterization of bi-interpretability. This is done by creating a biequivalence between a bicategory of…

Logic · Mathematics 2023-07-11 Anthony D'Arienzo , Vinny Pagano , Ian M. J. McInnis

A double category of relations is essentially a cartesian equipment with strong, discrete and functorial tabulators and for which certain local products satisfy a Frobenius Law. A double category of relations is equivalent to a double…

Category Theory · Mathematics 2022-11-18 Michael Lambert

We study the interaction between the notions of filteredness, fractions and fibrations in the theory of bicategories, generalizing classical results for categories. We give an explicit formula for filtered pseudo-colimits of categories…

Category Theory · Mathematics 2021-12-02 P. Bustillo Vazquez , D. Pronk , M. Szyld

In this thesis, we develop the theory of bifibrations of polycategories. We start by studying how to express certain categorical structures as universal properties by generalising the shape of morphism. We call this phenomenon…

Category Theory · Mathematics 2023-05-25 Nicolas Blanco

Combining insights from the study of type refinement systems and of monoidal closed chiralities, we show how to reconstruct Lawvere's hyperdoctrine of presheaves using a full and faithful embedding into a monoidal closed bifibration living…

Logic in Computer Science · Computer Science 2016-08-15 Paul-André Melliès , Noam Zeilberger

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…

Logic in Computer Science · Computer Science 2020-03-24 Filippo Bonchi , Jens Seeber , Pawel Sobocinski

We develop bicategory theory in univalent foundations. Guided by the notion of univalence for (1-)categories studied by Ahrens, Kapulkin, and Shulman, we define and study univalent bicategories. To construct examples of univalent…

Category Theory · Mathematics 2022-08-16 Benedikt Ahrens , Dan Frumin , Marco Maggesi , Niccolò Veltri , Niels van der Weide

In this exposition, we get examples of what is called a "linear hyperdoctrine", based on categories of comodules indexed by coalgebras. This structures can model first order linear logic.

Logic · Mathematics 2016-12-21 Mariana Haim , Octavio Malherbe

A concise guide to very basic bicategory theory, from the definition of a bicategory to the coherence theorem.

Category Theory · Mathematics 2007-05-23 Tom Leinster

In this paper we consider the class of l-bijective C-systems, i.e., C-systems for which the length function is a bijection. The main result of the paper is a construction of an isomorphism between two categories - the category of…

Logic · Mathematics 2015-12-29 Vladimir Voevodsky

Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and…

Logic · Mathematics 2025-02-12 H. Andréka , J. Madarász , I. Németi , G. Székely

We survey Lawvere theories at the level of infinity categories, as an alternative framework for higher algebra (rather than infinity operads). From a pedagogical perspective, they make many key definitions and constructions less technical.…

Category Theory · Mathematics 2019-03-12 John D. Berman

It is well-known that pseudo functors from bicategories of spans are equivalent to Beck-Chevalley bifibrations, and therefore capture the relationships underlying the adjunctions suitable as semantics for existential quantification. This…

Category Theory · Mathematics 2025-09-26 José Siqueira

We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…

Logic · Mathematics 2023-06-05 Colin Bloomfield , Yoshihiro Maruyama

Various concerns suggest looking for internal co-categories in categories with strong logical structure. It turns out that in any coherent category, all co-categories are co-equivalence relations.

Category Theory · Mathematics 2014-11-21 Peter LeFanu Lumsdaine

Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical,…

Quantum Physics · Physics 2014-12-31 Yoshihiro Maruyama

We introduce the concept of Frobenius theory as a generalisation of Lawvere's functorial semantics approach to categorical universal algebra. Whereas the universe for models of Lawvere theories is the category of sets and functions, or more…

Logic in Computer Science · Computer Science 2017-11-27 Filippo Bonchi , Dusko Pavlovic , Pawel Sobocinski
‹ Prev 1 2 3 10 Next ›