Results 1 
5 of
5
Equilogical Spaces
, 2001
"... It is well known that one can build models of full higherorder dependent type theory (also called the calculus of constructions) using partial equivalence relations (PERs) and assemblies over a partial combinatory algebra (PCA). But the idea of categories of PERs and ERs (total equivalence relation ..."
Abstract

Cited by 41 (12 self)
 Add to MetaCart
It is well known that one can build models of full higherorder dependent type theory (also called the calculus of constructions) using partial equivalence relations (PERs) and assemblies over a partial combinatory algebra (PCA). But the idea of categories of PERs and ERs (total equivalence relations) can be applied to other structures
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 18 (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
Sheaves for predicative toposes
 ArXiv:math.LO/0507480v1
"... Abstract: In this paper, we identify some categorical structures in which one can model predicative formal systems: in other words, predicative analogues of the notion of a topos, with the aim of using sheaf models to interprete predicative formal systems. Among our technical results, we prove that ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract: In this paper, we identify some categorical structures in which one can model predicative formal systems: in other words, predicative analogues of the notion of a topos, with the aim of using sheaf models to interprete predicative formal systems. Among our technical results, we prove that all the notions of a “predicative topos ” that we consider, are stable under presheaves, while most are stable under sheaves. 1
An Abstract Look At Realizability
, 2000
"... This paper is about purely categorical approaches to realizability, and contrasts with recent work particularly by Longley [14] and Lietz and Streicher [13], in which the basis is taken as a typed generalisation of a partial combinatory algebra. We, like they, will be interested in when the construc ..."
Abstract
 Add to MetaCart
This paper is about purely categorical approaches to realizability, and contrasts with recent work particularly by Longley [14] and Lietz and Streicher [13], in which the basis is taken as a typed generalisation of a partial combinatory algebra. We, like they, will be interested in when the construction yields a topos, and hence gives a full interpretation of higherorder logic. This is also a theme of Birkedal's work, see [1, 2], and his joint work in [3]. Birkedal makes considerable use of the construction we study. We present realizability toposes as the product of two constructions. First one takes a category (which corresponds to the typed partial combinatory algebra), and then one glues Set to it in a variant of the comma construction. This, as we shall see, has the eect of improving the categorical properties of the algebra category. Then one takes an exact completion of the result. This also has the eect of improving the categorical properties. Formally the main result of the paper is that the result is a topos just (modulo some technical conditions) when the original category has a universal object. Early work on realizability (e.g.[12, 22], or see [23]) is characterised by its largely syntactic nature. The core denition is when a sentence of some formal logic is realised, and the main interest is in when certain deductive principles (such as Markov's rule) are validated. Martin Hyland's invention y The authors wish to acknowledge the support of the EPSRC, EU Working Group 26142 APPSEM, and MURST 1 2 of realizability toposes [10] advances on this, not only in the simplicity of the construction, but by providing a semantic framework in which the formal logics can naturally be interpreted. Hyland was strongly motivated in his work by a then recent approach...