We consider two preorder-enriched categories of ordered partial combinatory algebras: OPCA, where the arrows are functional (i.e., projective) morphisms, and OPCA†, where the arrows are applicative morphisms. We show that OPCA has small products and finite biproducts, and that OPCA† has finite coproducts, all in a suitable 2-categorical sense. On the other hand, OPCA† lacks all nontrivial binary products. We deduce from this that the pushout, over Set, of two nontrivial realizability toposes is never a realizability topos. In contrast, we show that nontrivial subtoposes of realizability toposes are closed under pushouts over Set
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 employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...
We consider two preorder-enriched categories of ordered partial combinatory algebras: OPCA, where th...
We consider two preorder-enriched categories of ordered PCAs: OPCA, where the arrows are functional ...
Partial combinatory algebras (pca's, for short), are well-known to form the basic ingredient for the...
Partial combinatory algebras (pca's, for short), are well-known to form the basic ingredient for the...
A partial combinatory algebra (PCA) is a model of computation that embodies a certain notion of algo...
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial ...
Abstract. Geometric morphisms between realizability toposes are studied in terms of morphisms betwee...
A partial combinatory algebra (PCA) is a set equipped with a partial binary operation that models a ...
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial ...
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...
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...
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...
We consider two preorder-enriched categories of ordered partial combinatory algebras: OPCA, where th...
We consider two preorder-enriched categories of ordered PCAs: OPCA, where the arrows are functional ...
Partial combinatory algebras (pca's, for short), are well-known to form the basic ingredient for the...
Partial combinatory algebras (pca's, for short), are well-known to form the basic ingredient for the...
A partial combinatory algebra (PCA) is a model of computation that embodies a certain notion of algo...
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial ...
Abstract. Geometric morphisms between realizability toposes are studied in terms of morphisms betwee...
A partial combinatory algebra (PCA) is a set equipped with a partial binary operation that models a ...
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial ...
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...
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...
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...