Searcharxiv⌕ Search

arXiv subjects

Fabio Pasquali

Publications and source records attributed to Fabio Pasquali.

16 recordsLinked to original sources
arXiv2026

Quotients-comprehensions duality in relational doctrines

We establish a duality between quotients and comprehensions in relational doctrines, a class of indexed posets modelling (a minimal fragment of) the calculus of relations. We show that every relational doctrine determines an ``opposite" relational doctrine and that one has quotients if and only if the other has comprehensions. This duality extends to the 2-categorical level, yielding a 2-dual isomorphism between the 2-categories of relational doctrines with quotients and that with comprehensions, allowing to derive results on relational doctrines with comprehensions from their dual counterparts for quotients, and viceversa. We also study the interaction between quotients and comprehensions and their relative completions, giving sufficient conditions for the induced 2-monads to be composable, \ie sufficient conditions ensuring that applying both the completions, the second one preserves the properties added by the first one.

math.CT↗
arXiv2026

Projective covers, doctrines of algebras and the relational quotient completion

The extensional quotient completion of relational doctrines provides a common generalization of both the exact completion of categories with weak finite limits and the elementary quotient completion of existential elementary doctrines. In this paper, we study projective objects in relational doctrines with quotients, characterizing those obtained through the extensional quotient completion as those admitting a projective cover. We apply this result to doctrines of algebras for monads on relational doctrines with quotients, describing in which cases these arise as the extensional quotient completion of their restriction to (appropriate subcategories of) free algebras. This extends a similar result for monadic categories over exact ones, covering also more examples such as monads over the category of metric spaces giving rise to variants of quantitative algebras.

math.CT↗
arXiv2026

Quasitoposes as elementary quotient completions

The elementary quotient completion of an elementary doctrine in the sense of Lawvere was introduced in previous work by the first and third authors. It generalises the exact completion of a category with finite products and weak equalisers. In this paper we characterise when an elementary quotient completion is a quasi-topos. We obtain as a corollary a complete characterisation of when an elementary quotient completions is an elementary topos. As a byproduct we determine also when the elementary quotient completion of a tripos is equivalent to the doctrine obtained via the tripos-to-topos construction. Our results are reminiscent of other works regarding exact completions and put those under a common scheme: in particular, Carboni and Vitale's characterisation of exact completions in terms of their projective objects, Carboni and Rosolini's characterisation of locally cartesian closed exact completions, also in the revision by Emmenegger, and Menni's characterisation of the exact completions which are elementary toposes.

math.LO↗
arXiv2025

Quantitative Equality in Substructural Logic via Lipschitz Doctrines

Substructural logics naturally support a quantitative interpretation of formulas, as they are seen as consumable resources. Distances are the quantitative counterpart of equivalence relations: they measure how much two objects are similar, rather than just saying whether they are equivalent or not. Hence, they provide the natural choice for modelling equality in a substructural setting. In this paper, we develop this idea, using the categorical language of Lawvere's doctrines. We work in a minimal fragment of Linear Logic enriched by graded modalities, which are needed to write a resource sensitive substitution rule for equality, enabling its quantitative interpretation as a distance. We introduce both a deductive calculus and the notion of Lipschitz doctrine to give it a sound and complete categorical semantics. The study of 2-categorical properties of Lipschitz doctrines provides us with a universal construction, which generates examples based for instance on metric spaces and quantitative realisability. Finally, we show how to smoothly extend our results to richer substructural logics, up to full Linear Logic with quantifiers.

cs.LO↗
arXiv2024

The Relational Quotient Completion

Taking a quotient roughly means changing the notion of equality on a given object, set or type. In a quantitative setting, equality naturally generalises to a distance, measuring how much elements are similar instead of just stating their equivalence. Hence, quotients can be understood quantitatively as a change of distance. In this paper, we show how, combining Lawvere's doctrines and the calculus of relations, one can unify quantitative and usual quotients in a common picture. More in detail, we introduce relational doctrines as a functorial description of (the core of) the calculus of relations. Then, we define quotients and a universal construction adding them to any relational doctrine, generalising the quotient completion of existential elementary doctrine and also recovering many quantitative examples. This construction deals with an intensional notion of quotient and breaks extensional equality of morphisms. Then, we describe another construction forcing extensionality, showing how it abstracts several notions of separation in metric and topological structures. Combining these two constructions, we get the extensional quotient completion, whose essential image is characterized through the notion of projective cover. As an application, we show that, under suitable conditions, relational doctrines of algebras arise as the extensional quotient completion of free algebras. Finally, we compare relational doctrines to other categorical structures where one can model the calculus of relations.

math.CT↗
arXiv2024

Cauchy-completions and the rule of unique choice in relational doctrines

Lawvere's generalised the notion of complete metric space to the field of enriched categories: an enriched category is said to be Cauchy-complete if every left adjoint bimodule into it is represented by an enriched functor. Looking at this definition from a logical standpoint, regarding bimodules as an abstraction of relations and functors as an abstraction of functions, Cauchy-completeness resembles a formulation of the rule of unique choice. In this paper, we make this analogy precise, using the language of relational doctrines, a categorical tool that provides a functorial description of the calculus of relations, in the same way Lawvere's hyperdoctrines give a functorial description of predicate logic. Given a relational doctrine, we define Cauchy-complete objects as those objects of the domain category satisfying the rule of unique choice. Then, we present a universal construction that completes a relational doctrine with the rule of unique choice, that is, producing a new relational doctrine where all objects are Cauchy-complete. We also introduce relational doctrines with singleton objects and show that these have the minimal structure needed to build the reflector of the full subcategory of its domain on Cauchy-complete objects. The main result is that this reflector exists if and only if the relational doctrine has singleton objects and this happens if and only if its restriction to Cauchy-complete objects is equivalent to its completion with the rule of unique choice. We support our results with many examples, also falling outside the scope of standard doctrines, such as complete metric spaces, Banach spaces and compact Hausdorff spaces in the general context of monoidal topology, which are all shown to be Cauchy-complete objects for appropriate relational doctrines.

math.CT↗
arXiv2020

A characterisation of elementary fibrations

Grothendieck fibrations provide a unifying algebraic framework that underlies the treatment of various form of logics, such as first order logic, higher order logics and dependent type theories. In the categorical approach to logic proposed by Lawvere, which systematically uses adjoints to describe the logical operations, equality is presented in the form of a left adjoint to reindexing along a diagonal arrows in the base. Taking advantage of the modular perspective provided by category theory, one can look at those Grothendieck fibrations which sustain just the structure of equality, the so-called elementary fibrations, aka fibrations with equality. The present paper provides a characterisation of elementary fibrations based on particular structures in the fibres, called transporters. The characterisation is a substantial generalisation of the one already available for faithful fibrations. There is a close resemblance between transporters and the structures used in the semantics of the identity type of Martin-Löf type theory. We close the paper by comparing the two.

math.CT↗
arXiv2019

Elementary Quotient Completions, Church's Thesis, and Partioned Assemblies

Hyland's effective topos offers an important realizability model for constructive mathematics in the form of a category whose internal logic validates Church's Thesis. It also contains a boolean full sub-quasitopos of "assemblies" where only a restricted form of Church's Thesis survives. In the present paper we compare the effective topos and the quasitopos of assemblies each as the elementary quotient completions of a Lawvere doctrine based on the partitioned assemblies. In that way we can explain why the two forms of Church's Thesis each category satisfies differ by the way each is inherited from specific properties of the doctrine which determines the elementary quotient completion.

math.LO↗
arXiv2016

Aristotle's square of opposition in the light of Hilbert's epsilon and tau quantifiers

Aristotle considered particular quantified sentences in his study of syllogisms and in his famous square of opposition. Of course, the logical formulas in Aristotle work were not modern formulas of mathematical logic, but ordinary sentences of natural language. Nowadays natural language sentences are turned into formulas of predicate logic as defined by Frege, but, it is not clear that those Fregean sentences are faithful representations of natural language sentences. Indeed, the usual modelling of natural language quantifiers does not fully correspond to natural language syntax, as we shall see. This is the reason why Hilbert's epsilon and tau quantifiers (that go beyond usual quantifiers) have been used to model natural language quantifiers. Here we interpret Aristotle quantified sentences as formulas of Hilbert's epsilon and tau calculus. This yields to two potential squares of opposition and provided a natural condition holds, one of these two squares is actually a square of opposition i.e. satisfies the relations of contrary, contradictory, and subalternation.

math.LO↗
arXiv2014

A sheafification theorem for doctrines

We define the notion of sheaf in the context of doctrines. We prove the associate sheaf functor theorem. We show that grothendieck toposes and toposes obtained by the tripos to topos construction are instances of categories of sheaves for a suitable doctrine.

math.LO↗
arXiv2014

Remarks on the Tripos To Topos Construction: extensionality, comprehensions, quotients and cauchy-complete objects

We give a description of the Tripos To Topos construction in terms of four free constructions. We prove that these compose up to give a free construction from the category of triposes and logical morphisms to the category of toposes and logical functors. Then we show that other similar constructions, i.e. the one given by Frey in \cite{frey} and that of Carboni in \cite{carbons} are instances of this one.

math.CT↗
arXiv2014

A co-free construction for elementary doctrines

We provide a co-free construction which adds elementary structure to a primary doctrine. We show that the construction preserves comprehensions and all the logical operations which are in the starting doctrine, in the sense that it maps a first order many-sorted theory into a the same theory formulated with equality. As a corollary it forces an implicational doctrine to have an extentional entailment.

math.LO↗