This work is a step toward the development of a logic for types and computation that includes not only the usual spaces of mathematics and constructions, but also spaces from logic and domain theory. Using realizability, we investigate a configuration of three toposes that we regard as describing a notion of relative computability. Attention is focussed on a certain local map of toposes, which we first study axiomatically, and then by deriving a modal calculus as its internal logic. The resulting framework is intended as a setting for the logical and categorical study of relative computability
A partial combinatory algebra (PCA) is a model of computation that embodies a certain notion of algo...
AbstractComputability theory, which investigates computable functions and computable sets, lies at t...
AbstractVersions and extensions of intuitionistic and modal logic involving biHeyting and bimodal op...
AbstractThis work is a step toward developing a logic for types and computation that includes both t...
Steve Awodey, Lars Birkendal, and Dana S. Scott. Local Realizability Toposes and a Modal Logic for C...
AbstractWe investigate the development of theories of types and computability via realizability.In t...
Realizability toposes are "models of constructive set theory" based on abstract notions of computabi...
AbstractThe classical forms of both modified realizability and relative realizability are naturally ...
The thesis is a comprehensive analysis of realizability toposes, which is divided into three central...
We introduce a category of basic combinatorial objects, encompassing PCAs and locales. Such a basic ...
We investigate the development of theories of types and computability via realizability. In the firs...
AbstractThe modified realizability topos is the semantic (and higher order) counterpart of a variant...
Constructive mathematics is mathematics without the use of the principle of the excluded middle. The...
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 ...
A partial combinatory algebra (PCA) is a model of computation that embodies a certain notion of algo...
AbstractComputability theory, which investigates computable functions and computable sets, lies at t...
AbstractVersions and extensions of intuitionistic and modal logic involving biHeyting and bimodal op...
AbstractThis work is a step toward developing a logic for types and computation that includes both t...
Steve Awodey, Lars Birkendal, and Dana S. Scott. Local Realizability Toposes and a Modal Logic for C...
AbstractWe investigate the development of theories of types and computability via realizability.In t...
Realizability toposes are "models of constructive set theory" based on abstract notions of computabi...
AbstractThe classical forms of both modified realizability and relative realizability are naturally ...
The thesis is a comprehensive analysis of realizability toposes, which is divided into three central...
We introduce a category of basic combinatorial objects, encompassing PCAs and locales. Such a basic ...
We investigate the development of theories of types and computability via realizability. In the firs...
AbstractThe modified realizability topos is the semantic (and higher order) counterpart of a variant...
Constructive mathematics is mathematics without the use of the principle of the excluded middle. The...
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 ...
A partial combinatory algebra (PCA) is a model of computation that embodies a certain notion of algo...
AbstractComputability theory, which investigates computable functions and computable sets, lies at t...
AbstractVersions and extensions of intuitionistic and modal logic involving biHeyting and bimodal op...