The strength of the subset type in Martin-Lof's type theory

Abstract

The authors show that the exact formulation of the rules of type theory is important for rules of subset type. It turns out that there are propositions involving subsets that are trivially true in naive set theory, but which cannot be proved in type theory. They examine the probability of a type proposition that is important when modularizing program derivations.<>