Qianli Zeng

This paper provides a procedure which, from any Boolean system of sentences, outputs another Boolean system called the ‘_m_-cycle unwinding’ of the original Boolean system for any positive integer _m_. We prove that for all \(m>1\), this procedure eliminates the direct self-reference in that the _m_-cycle unwinding of any Boolean system must be indirectly self-referential. More importantly, this procedure can preserve the primary periods of Boolean paradoxes: whenever _m_ is relatively prime to all primary periods of a Boolean paradox, this paradox and its _m_-cycle unwinding have the same primary periods. In this way, we can produce an indirectly self-referential Boolean paradox with the same periodic characteristics as a known Boolean paradox.