 Such propositions are known as formally undecidable propositions.For example, the continuum hypothesis is undecidable in the Zermelo-Fraenkel set theory as shown by Cohen.The role of reduction in computer science can be thought as a (precise and unambiguous) mathematical formalization of the philosophical idea of "theory reductionism".