Abstract: According to the notions introduced by Cook et al., Yablo's paradox can be considered as an "unwinding" of the Liar. It has been proved that the unwinding preserves the degree of paradoxicality of the Liar, and thus the circularity of the Liar. Moreover, the above conclusion is also true for all n-card paradoxes and their unwindings. In this paper, the conclusion is extended to a larger class of paradoxes——Boolean paradoxes. Sentence net is applied to represent Boolean paradoxes and their unwindings. It is shown that any Boolean paradox has the same degree of paradoxicality as its Yabloseque unwinding. As a result, both of them depend on the same circularity.