PROPOSITION 5.

1
For any family of logics , and any ,
iff
PROOF: () Suppose < . Hence . So for all () if then
and there is some () such that but . That is, for all () and
if () then (), and there is some () and such that
() but (). This leads to the following general relationship:

Ok, now what does this mean? Given that this relationship is true for all sets (),
whenever < , then clearly every -closed set is -closed (if () then ()), and
some -closed sets are not -closed (there is some () and such that
() but ()). But -closed sets are just -worlds, and -closed sets are just -worlds,
by definition. So, this translates to every -world being an -world, and some -worlds not
being -worlds, i.e. , as required. Another way of seeing this is to recognize that
contains worlds violating some -rule, i.e. supposing , there will exist an -world
such that but .