Arrow Research search

Author name cluster

Fabio Pasquali

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

4 papers
2 author rows

Possible papers

4

FSCD Conference 2023 Conference Paper

Quotients and Extensionality in Relational Doctrines

  • Francesco Dagnino
  • Fabio Pasquali

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. Quotients are crucial in many constructions both in mathematics and computer science and have been widely studied using categorical tools. Among them, Lawvere’s doctrines stand out, providing a fairly simple functorial framework capable to unify many notions of quotient and related constructions. However, abstracting usual predicate logics, they cannot easily deal with quantitative settings. In this paper, we show how, combining 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.

FLAP Journal 2017 Journal Article

From Logical and Linguistic Generics to Hilbert's tau and epsilon Quantifiers.

  • Stergios Chatzikyriakidis
  • Fabio Pasquali
  • Christian Retoré

With our starting point being (universal) generics appearing in both natural language and mathematical proofs, and were further conceptualised in philosophy of language, we introduce the tau subnector that maps a formula F to an individual term τx F such that F (τx F ) whenever ∀xF. We then introduce the dual subnector x F which expresses the existential quantification since F ( x F ) ≡ ∃xF, and describe its use for the semantics of indefinite and definite noun phrases. Some logical and linguistic properties of this intriguing way to express quantification are discussed — but the reader is referred to the article by Abrusci in this volume for the impact of epsilon on Hilbert’s work the logical foundations of mathematics.

v2026.09.13