We give a complete proof that all 3-quantifier sentences in the primitive notation of set theory (∈, =), are decided in ZFC, and in fact in a weak fragment of ZF without the power set axiom. We obtain information concerning witnesses of 2-quantifier formulas with one free variable. There is a 5-quantifier sentence that is not decided in ZFC (see [2]).
We propose a "natural" axiomatic theory of the Foundations of Mathematics (Theory Q) where, in addition to the membership relation (between elements and classes), pairs, sets, natural numbers, n-tuples and operations are also introduced as primitives by means of suitable ground classes. Moreover, the theory Q allows an easy introduction of other mathematical and logical entities. The theory Q is finitely axiomatized in § 2, using a first-order language with a binary relation (membership) and five...
In this article, semiring and semialgebra of sets are formalized so as to construct a measure of a given set in the next step. Although a semiring of sets has already been formalized in [13], that is, strictly speaking, a definition of a quasi semiring of sets suggested in the last few decades [15]. We adopt a classical definition of a semiring of sets here to avoid such a confusion. Ring of sets and algebra of sets have been formalized as non empty preboolean set [23] and field of subsets [18],...