Abstract

This article contains the proof of equivalence boolean algebra and syllogistics arc2. The system arc2 is obtained as a superstructure above the propositional calculus. Subjects and predicates of syllogistic functors a, E, J, O may be complex terms, Which are formed using operations of intersection, Union and complement. In contrast to negative sentences the interpretation of affirmative sentences suggests non-Empty terms. To prove the corresponding theorem we demonstrate that boolean algebra is included into syllogistics arc2 and vice versa