(theorem 6, ? 4) we show that in Wedberg's system [14] with primitives 'Aab', 'a" (not a), it is possible to find a mapping a -T(a) as above such that 'Aab' is equivalent to '92(a) is contained in 9p(b)' and 9p(a') is equal to p(a)', the complement of p(a) with respect to V. Thus, if we make the preliminary step of identifying elements a, b such that Aab and Aba both hold (i.e. taking equivalence classes with respect to the relation Aab & Aba), we are left with essentially only one kind of interpretation for these systems, namely the 'normal' interpretation by classes. Slupecki [1 1], [12] has proved that Lukasiewicz's system is a complete and decidable theory of the relations of inclusion and intersection of non-null classes, and Wedberg [14] has proved that his system is a complete and decidable theory of the relation of inclusion and the operation of complementation for nonnull, non-universal classes. Using the above-mentioned embedding theorem, we are able to obtain (theorems 9, 6, ?? 5, 4) very simple proofs of these results. For the sake of completeness and simplicity of presentation we deal first with the theory of inclusion and complementation for general (i.e. not necessarily non-null, non-universal) classes. In this way all the results follow with very little further effort from our theorem 1 which says, essentially, that a sufficient (and obviously necessary) condition for a partially ordered set S with a 'complement' operation "' to be embeddable, with preservation of complements, in a Boolean algebra is that, for all a, b of S, a" = a, a ? b .). b' ? a', and a ? a' .D. a ? b.
[1]
Jan Łukasiewicz.
Aristotle's Syllogistic From the Standpoint of Modern Formal Logic
,
1957
.
[2]
Hans Hermes.
Zur Theorie der aussagenlogischen Matrizen
,
1951
.
[3]
J. C. C. McKinsey,et al.
A Solution of the Decision Problem for the Lewis systems S2 and S4, with an Application to Topology
,
1941,
J. Symb. Log..
[4]
Joseph T. Clark,et al.
Aristotle's Syllogistic from the Standpoint of Modern Formal Logic.
,
1952
.
[5]
Leon Henkin,et al.
The completeness of the first-order functional calculus
,
1949,
Journal of Symbolic Logic.
[6]
J. C. C. McKinsey,et al.
The decision problem for some classes of sentences without quantifiers
,
1943,
Journal of Symbolic Logic.