Mathematics and Computation

A blog about mathematics for computers

Postsby categoryby yearall

Posts in the year 2001

Sheaf Toposes for Realizability

with Steve Awodey.

Abstract: We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms to study the relationship between realizability models over different partial combinatory algebras. This research is part of the Logic of Types and Computation project at Carnegie Mellon University under the direction of Dana Scott.

Sumitted for publication.

Download: sheaves_realizability.pdf, sheaves_realizability.ps.gz

continue reading
Postsby categoryby yearall