Sets in types, types in sets [chapter]

Benjamin Werner
1997 Lecture Notes in Computer Science  
We present two mutual encodings, respectively of the Calculus of Inductive Constructions in Zermelo-Fr nkel set theory and the opposite way. More precisely, we actually construct two families of encodings, relating the number of universes in the type theory with the number of inaccessible cardinals in the set theory. The main result is that both hierarchies of logical formalisms interleave w.r.t. expressive power and thus are essentially equivalent. Both encodings are quite elementary: type
more » ... ry is interpreted in set theory through a generalization of Coquand's simple proof-irrelevance interpretation. Set theory is encoded in type theory using a variant of Aczel's encoding; we have formally checked this last part using the Coq proof assistant.
doi:10.1007/bfb0014566 fatcat:r2wt56ltwbealgf4bwjbqo3a6q