Results 1  10
of
32
Exact Completions and Toposes
 University of Edinburgh
, 2000
"... Toposes and quasitoposes have been shown to be useful in mathematics, logic and computer science. Because of this, it is important to understand the di#erent ways in which they can be constructed. Realizability toposes and presheaf toposes are two important classes of toposes. All of the former and ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
(Show Context)
Toposes and quasitoposes have been shown to be useful in mathematics, logic and computer science. Because of this, it is important to understand the di#erent ways in which they can be constructed. Realizability toposes and presheaf toposes are two important classes of toposes. All of the former and many of the latter arise by adding &quot;good &quot; quotients of equivalence relations to a simple category with finite limits. This construction is called the exact completion of the original category. Exact completions are not always toposes and it was not known, not even in the realizability and presheaf cases, when or why toposes arise in this way. Exact completions can be obtained as the composition of two related constructions. The first one assigns to a category with finite limits, the &quot;best &quot; regular category (called its regular completion) that embeds it. The second assigns to
A minimalist twolevel foundation for constructive mathematics
, 2008
"... We present a twolevel theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin [MS05]. One level is given by an intensional type theory, called Minimal type theory. This theory extends the settheoretic version introduced in [MS05] with collections. The other lev ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
We present a twolevel theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin [MS05]. One level is given by an intensional type theory, called Minimal type theory. This theory extends the settheoretic version introduced in [MS05] with collections. The other level is given by an extensional set theory that is interpreted in the first one by means of a quotient model. This twolevel theory has two main features: it is minimal among the most relevant foundations for constructive mathematics; it is constructive thanks to the way the extensional level is linked to the intensional one which fulfills the “proofsasprograms” paradigm and acts as a programming language.
A Characterization Of The Left Exact Categories Whose Exact Completions Are Toposes
, 1999
"... We characterize the categories with finite limits whose exact completions are toposes. We review the examples in the literature and also find new examples and counterexamples. ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We characterize the categories with finite limits whose exact completions are toposes. We review the examples in the literature and also find new examples and counterexamples.
Maps II: Chasing Diagrams in Categorical Proof Theory
, 1996
"... In categorical proof theory, propositions and proofs are presented as objects and arrows in a category. It thus embodies the strong constructivist paradigms of propositionsastypes and proofsasconstructions, which lie in the foundation of computational logic. Moreover, in the categorical setting, ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
In categorical proof theory, propositions and proofs are presented as objects and arrows in a category. It thus embodies the strong constructivist paradigms of propositionsastypes and proofsasconstructions, which lie in the foundation of computational logic. Moreover, in the categorical setting, a third paradigm arises, not available elsewhere: logicaloperationsasadjunctions. It offers an answer to the notorious question of the equality of proofs. So we chase diagrams in algebra of proofs. On the basis of these ideas, the present paper investigates proof theory of regular logic: the f; 9gfragment of the first order logic with equality. The corresponding categorical structure is regular fibration. The examples include stable factorisations, sites, triposes. Regular logic is exactly what is needed to talk about maps, as total and singlevalued relations. However, when enriched with proofsasarrows, this familiar concept must be supplied with an additional conversion rule, conn...
A note on the free regular and exact completions and their infinitary generalizations
 THEORY AND APPLICATIONS OF CATEGORIES
, 1996
"... Free regular and exact completions of categories with various ranks of weak limits are presented as subcategories of presheaf categories. Their universal properties can then be derived with standard techniques as used in duality theory. ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
Free regular and exact completions of categories with various ranks of weak limits are presented as subcategories of presheaf categories. Their universal properties can then be derived with standard techniques as used in duality theory.
A Note On The Exact Completion Of A Regular Category, And Its Infinitary Generalizations
, 1999
"... A new description of the exact completion C ex/reg of a regular category C is given, using a certain topos Shv(C) of sheaves on C; the exact completion is then constructed as the closure of C in Shv(C) under finite limits and coequalizers of equivalence relations. An infinitary generalization is ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
A new description of the exact completion C ex/reg of a regular category C is given, using a certain topos Shv(C) of sheaves on C; the exact completion is then constructed as the closure of C in Shv(C) under finite limits and coequalizers of equivalence relations. An infinitary generalization is proved, and the classical description of the exact completion is derived.
On The Monadicity Of Categories With Chosen Colimits
 THEORY APPL. CATEG
, 2000
"... There is a 2category JColim of small categories equipped with a choice of colimit for each diagram whose domain J lies in a given small class J of small categories, functors strictly preserving such colimits, and natural transformations. The evident forgetful 2functor from JColim to the 2ca ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
There is a 2category JColim of small categories equipped with a choice of colimit for each diagram whose domain J lies in a given small class J of small categories, functors strictly preserving such colimits, and natural transformations. The evident forgetful 2functor from JColim to the 2category Cat of small categories is known to be monadic. We extend this result by considering not just conical colimits, but general weighted colimits; not just ordinary categories but enriched ones; and not just small classes of colimits but large ones; in this last case we are forced to move from the 2category VCat of small Vcategories to Vcategories with objectset in some larger universe. In each case, the functors preserving the colimits in the usual "uptoisomorphism" sense are recovered as the pseudomorphisms between algebras for the 2monad in question.
Type Theory via Exact Categories (Extended Abstract)
 In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science LICS '98
, 1998
"... Partial equivalence relations (and categories of these) are a standard tool in semantics of type theories and programming languages, since they often provide a cartesian closed category with extended definability. Using the theory of exact categories, we give a categorytheoretic explanation of why ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
Partial equivalence relations (and categories of these) are a standard tool in semantics of type theories and programming languages, since they often provide a cartesian closed category with extended definability. Using the theory of exact categories, we give a categorytheoretic explanation of why the construction of a category of partial equivalence relations often produces a cartesian closed category. We show how several familiar examples of categories of partial equivalence relations fit into the general framework. 1 Introduction Partial equivalence relations (and categories of these) are a standard tool in semantics of programming languages, see e.g. [2, 5, 7, 9, 15, 17, 20, 22, 35] and [6, 29] for extensive surveys. They are usefully applied to give proofs of correctness and adequacy since they often provide a cartesian closed category with additional properties. Take for instance a partial equivalence relation on the set of natural numbers: a binary relation R ` N\ThetaN on th...
ELEMENTARY QUOTIENT COMPLETION
"... Abstract. We extend the notion of exact completion on a category with weak finite limits to Lawvere’s elementary doctrines. We show how any such doctrine admits an elementary quotient completion, which is the universal solution to adding certain quotients. We note that the elementary quotient compl ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. We extend the notion of exact completion on a category with weak finite limits to Lawvere’s elementary doctrines. We show how any such doctrine admits an elementary quotient completion, which is the universal solution to adding certain quotients. We note that the elementary quotient completion can be obtained as the composite of two other universal constructions: one adds effective quotients, the other forces extensionality of morphisms. We also prove that each construction preserves comprehension.