[SCL] Quantifying over propositions

[John F. Sowa]

Chris,

Thanks for the clarification.  That is what
I had thought from our discussions, but in
a recent note, Pat had said something about
introducing a notation [p] for quantifying
over propositions, and I didn't see why.
I had been traveling, and I may have missed
some messages and telecons.

In any case, the ISO draft should be clarified.
I found only one sentence that said a sequence
may be empty, but two points were unclear:

  1. The tables use the notation 1,...,n without
     any mention of what happens when n=0 or 1.

  2. Even if sequences may be empty, it wasn't
     clear whether empty sequences may appear in
     every place where a sequence is expected.

  3. Except for (and) and (or), there were no
     other examples of empty sequences and no
     mention of the fact that a relation with
     zero arguments is equivalent to a proposition.

I suggest that these points be clarified in the
next draft.

John