ABSTRACT
I continue to consider the language F m (n ) w ith the connectives A , v , - » , n . I define a new kind of sequents, called M-sequents: they shall be ordered pairs < M , N > , w ritten as M = $ N , and consisting of two (possibly em pty) sequences or sets M , N of formulas, the latter of which also is called the succedent of the M -sequent. Again, ▲ shall be used to sym bolize an em pty antecedent or em pty succedent.
