A general notion of realizability

• Published in: Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) pp. 7 - 17
• Main Author: Birkedal, L.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2000
• Subjects: Algebra; Assembly; Electrical capacitance tomography; Lattices; Logic; Principal component analysis
• ISBN: 9780769507255; 0769507255
• ISSN: 1043-6871; 2575-5528
• DOI: 10.1109/LICS.2000.855751

We present a general notion of realizability, encompassing both standard Kleene style realizability over partial combinatory algebras and Kleene style realizability over more general structures, including all partial cartesian closed categories. We show how the general notion of realizability can be used to get models of dependent predicate logic, thus obtaining as a corollary (the known result) that the category Equ of equilogical spaces models dependent predicate logic. Moreover, we characterize when the general notion of realizability gives rise to a topos.