A simple computational interpretation of set theory

CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of constructive interpretations: sets are well-founded extensional computable conditional enumerations of sets. One interpretation in this family is just this: all sets are inductively built from the empty set by iterating the construction {f_n | n:N ^ g_n = h_n}, where, in turn, g and h are computable sequences of sets, and f is a computable sequence such that f_n is a set when g_n and h_n are extensionally equal. Extended Church's Thesis, an assumption which is incompatible with classical logic, is required to make this a model of CZF. Besides its foundational interest, it yields a direct conservativity result for certain choice principles, the Subcountability axiom, and for some so-called Omniscience principles, including first-order arithmetic Omniscience. A larger interpretation in this family also models the Regular Extension Axiom.