 In set theories based on strong relevant logics, like \(\mathbf{E}\) and \(\mathbf{R}\), as well as in classical set theory, if we add the naïve comprehension axiom, we are able to derive any formula at all. Thus, naïve set theories based on systems such as \(\mathbf{E}\) and \(\mathbf{R}\) are said to be “trivial”. Here is an intuitive sketch of the proof of the triviality of a naïve set theory using principles of inference from the logic R. Let \(p\) be an arbitrary proposition: