Erratum to Ordered Partial Combinatory Algebras
PIETER J. W. HOFSTRA, Jaap van Oosten · Utrecht University Repository (Utrecht University) · 2003
To our regret the paper Ordered Partial Combinatory Algebras contains a mistake which we correct here The flaw concerns the definition of compu tational density definition 3.5 which appeared in section 3.3 page 451 This definition is too rigid and as a consequence Lemma 3.6 on page 452 is false We will first give the correct definition of computational density and show how the computationally dense maps give rise to geometric morphisms of triposes. Then we state the correct version of lemma 3.6 and its proof.