We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley’s preorder-enriched category of partial combinatory algebras and decidable applicative structures. We also investigate total combinatory algebras of partial functions. One of the results is, that every realizability topos is a geometric quotient of a realizability topos on a total combinatory algebr
Abstract. Geometric morphisms between realizability toposes are studied in terms of morphisms betwee...
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...
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...
The purpose of this note is to observe a generalization of the concept “computable in... ” to arbitr...
The purpose of this note is to observe a generalization of the concept "computable in..." to arbitra...
The purpose of this note is to observe a generalization of the concept "computable in..." to arbitra...
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...
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial ...
We investigate the representation and complete representation classes for algebras of partial functi...
Abstract. Geometric morphisms between realizability toposes are studied in terms of morphisms betwee...
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...
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...
The purpose of this note is to observe a generalization of the concept “computable in... ” to arbitr...
The purpose of this note is to observe a generalization of the concept "computable in..." to arbitra...
The purpose of this note is to observe a generalization of the concept "computable in..." to arbitra...
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...
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial ...
We investigate the representation and complete representation classes for algebras of partial functi...
Abstract. Geometric morphisms between realizability toposes are studied in terms of morphisms betwee...
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...