Related papers: Quotient completion for the foundation of construc…
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…
We extend the notion of exact completion on a weakly lex category to elementary doctrines. We show how any such doctrine admits an elementary quotient completion, which freely adds effective quotients and extensional equality. We note that…
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…
A quotient construction defines an abstract type from a concrete type, using an equivalence relation to identify elements of the concrete type that are to be regarded as indistinguishable. The elements of a quotient type are…
In this work, we fill the gap between the elementary quotient completion introduced by Maietti and Rosolini and the exact completion of a category with weak finite limits, as described by Carboni and Vitale. To achieve this, we generalize…
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.…
We provide a Lawvere-style definition for partial theories, extending the classical notion of equational theory by allowing partially defined operations. As in the classical case, our definition is syntactic: we use an appropriate class of…
We present a two-level theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin. One level is given by an intensional type theory, called Minimal type theory. This theory extends the set-theoretic version…
As several different formal systems with inequivalent syntax may describe equivalent semantics, it is possible to find `completions' to more expressive syntaxes that are semantically invariant. Doctrine theory, in the sense of Lawvere, is…
For a quantale $\V$, first a closure-theoretic approach to completeness and separation in $\V$-categories is presented. This approach is then generalized to $\Tth$-categories, where $\Tth$ is a topological theory that entails a set monad…
We define the notion of exact completion with respect to an existential elementary doctrine. We observe that the forgetful functor from the 2-category exact categories to existential elementary doctrines has a left biadjoint that can be…
It is known since 1973 that Lawvere's notion of (Cauchy-)complete enriched category is meaningful for metric spaces: it captures exactly Cauchy-complete metric spaces. In this paper we introduce the corresponding notion of Lawvere…
We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…
The recent trend in mathematics is towards a framework of abstract mathematical objects, rather than the more concrete approach of explicitly defining elements which objects were thought to consist of. A natural question to raise is whether…
We contribute to the knowledge of the quantifier completions and their applications by using the language of doctrines. This algebraic presentation allows us to properly analyse the behaviour of the existential and universal quantifiers. We…
Quotients and comprehension are fundamental mathematical constructions that can be described via adjunctions in categorical logic. This paper reveals that quotients and comprehension are related to measurement, not only in quantum logic,…
In this work we study the notions of structural and universal completeness both from the algebraic and logical point of view. In particular, we provide new algebraic characterizations of quasivarieties that are actively and passively…
Lawvere observed in his celebrated work on hyperdoctrines that the set-theoretic schema of comprehension can be elegantly expressed in the functorial language of categorical logic, as a comprehension structure on the functor…
Recently, Abbadini and Guffanti gave an algebraic proof of Herbrand's theorem using a completion for Lawvere doctrines that freely adds existential and universal quantifiers. A more direct argument can be given by only completing with…
We provide a thorough algebraic analysis of three known completions having a central role in the exact completions of Lawvere's doctrines: the one adding comprehensive diagonals (i.e. forcing equality on terms to coincide with the equality…