* Sunday, 2011-11-27 at 15:49 -0300 - Jorge Llambías <jjllambias@gmail.com>:
> On Sun, Nov 27, 2011 at 1:36 PM, Martin Bays <mbays@sdf.org> wrote:
> >
> > (Except that it only works if the unfilled second place of {du} is
> > interpreted correctly... it would be nice to have a clearer way of
> > getting at the always-true unary predicate. Do we have one?)
>
> I suggest "suzdu'o", defined as:
>
> ko'a suzdu'o == su'o da zo'u ko'a du da
Not bad - but if {su'o} is a singular quantifier, and {du} works as I'd
expect, then that holds only when {ko'a} has only one referent.
Attachment:
pgpTTQOGo54VZ.pgp
Description: PGP signature