Partial combinatory algebras (pca's, for short), are well-known to form the basic ingredient for the construction of various realizability toposes, of which the Eective Topos is undoubtedly the most famous. There is more than one way to present the realizability topos associated to a pca; one may take the exact completion of the category of partitioned assemblies (see [7]), or one can use tripos theory. Triposes built from pca's are, together with those from locales, the most important and most extensively studied instances of triposes, but from a structural point of view, there are important dierences between the two; whereas locales are organized in a well-behaved category, which is a re ective subcategory of the category of toposes, it i...
We consider two preorder-enriched categories of ordered partial combinatory algebras: OPCA, where th...
Realizability toposes are "models of constructive set theory" based on abstract notions of computabi...
AbstractWe investigate the development of theories of types and computability via realizability.In t...
Partial combinatory algebras (pca's, for short), are well-known to form the basic ingredient for the...
We introduce a category of basic combinatorial objects, encompassing PCAs and locales. Such a basic ...
Abstract. Geometric morphisms between realizability toposes are studied in terms of morphisms betwee...
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial ...
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial ...
A partial combinatory algebra (PCA) is a model of computation that embodies a certain notion of algo...
We exhibit a way of “forcing a partial functional to be realizable as effective operation” for arbit...
We exhibit a way of “forcing a partial functional to be realizable as effective operation” for arbit...
We exhibit a way of “forcing a partial functional to be realizable as effective operation” for arbit...
We exhibit a way of “forcing a partial functional to be realizable as effective operation” for arbit...
Joyal and Moerdijk have shown that realizability toposes over partial combinatory algebras (pca) hos...
We consider two preorder-enriched categories of ordered partial combinatory algebras: OPCA, where th...
We consider two preorder-enriched categories of ordered partial combinatory algebras: OPCA, where th...
Realizability toposes are "models of constructive set theory" based on abstract notions of computabi...
AbstractWe investigate the development of theories of types and computability via realizability.In t...
Partial combinatory algebras (pca's, for short), are well-known to form the basic ingredient for the...
We introduce a category of basic combinatorial objects, encompassing PCAs and locales. Such a basic ...
Abstract. Geometric morphisms between realizability toposes are studied in terms of morphisms betwee...
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial ...
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial ...
A partial combinatory algebra (PCA) is a model of computation that embodies a certain notion of algo...
We exhibit a way of “forcing a partial functional to be realizable as effective operation” for arbit...
We exhibit a way of “forcing a partial functional to be realizable as effective operation” for arbit...
We exhibit a way of “forcing a partial functional to be realizable as effective operation” for arbit...
We exhibit a way of “forcing a partial functional to be realizable as effective operation” for arbit...
Joyal and Moerdijk have shown that realizability toposes over partial combinatory algebras (pca) hos...
We consider two preorder-enriched categories of ordered partial combinatory algebras: OPCA, where th...
We consider two preorder-enriched categories of ordered partial combinatory algebras: OPCA, where th...
Realizability toposes are "models of constructive set theory" based on abstract notions of computabi...
AbstractWe investigate the development of theories of types and computability via realizability.In t...