Boolean-Valued Set-Theoretic Systems: General Formalism and Basic Technique

This article is devoted to the study of the Boolean-valued universe as an algebraic system. We start with the logical backgrounds of the notion and present the formalism of extending the syntax of Boolean truth values by the use of definable symbols, internal classes, outer terms and external Boolean-valued classes. Next, we enrich the collection of Boolean-valued research tools with the technique of partial elements and the corresponding joins, mixings and ascents. Passing on to the set-theoretic signature, we prove that bounded formulas are absolute for transitive Boolean-valued subsystems. We also introduce and study intensional, predicative, cyclic and regular Boolean-valued systems, examine the maximum principle, and analyze its relationship with the ascent and mixing principles. The main applications relate to the universe over an arbitrary extensional Boolean-valued system. A close interrelation is established between such a universe and the intensional hierarchy. We prove the existence and uniqueness of the Boolean-valued universe up to a unique isomorphism and show that the conditions in the corresponding axiomatic characterization are logically independent. We also describe the structure of the universe by means of several cumulative hierarchies. Another application, based on the quantifier hierarchy of formulas, improves the transfer principle for the canonical embedding in the Boolean-valued universe.