From pycyn@aol.com Thu Aug 09 16:52:10 2001 Return-Path: X-Sender: Pycyn@aol.com X-Apparently-To: lojban@yahoogroups.com Received: (EGP: mail-7_3_1); 9 Aug 2001 23:52:10 -0000 Received: (qmail 43766 invoked from network); 9 Aug 2001 23:52:07 -0000 Received: from unknown (10.1.10.142) by l7.egroups.com with QMQP; 9 Aug 2001 23:52:07 -0000 Received: from unknown (HELO imo-r10.mx.aol.com) (152.163.225.106) by mta3 with SMTP; 9 Aug 2001 23:52:06 -0000 Received: from Pycyn@aol.com by imo-r10.mx.aol.com (mail_out_v31.9.) id r.8.184396a3 (4585) for ; Thu, 9 Aug 2001 19:52:03 -0400 (EDT) Message-ID: <8.184396a3.28a47c23@aol.com> Date: Thu, 9 Aug 2001 19:52:03 EDT Subject: Re: [lojban] A or B, depending on C, and related issues To: lojban@yahoogroups.com MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="part1_8.184396a3.28a47c23_boundary" X-Mailer: AOL 6.0 for Windows US sub 10531 From: pycyn@aol.com --part1_8.184396a3.28a47c23_boundary Content-Type: text/plain; charset="US-ASCII" Content-Transfer-Encoding: 7bit In a message dated 8/9/2001 4:01:41 PM Central Daylight Time, lojbab@lojban.org writes: > Actually it did. lu'a for selecting individuals from a set came *directly* > from your posing this problem to me back in 1989 or so. The other members > of lu'a were added later. I believe that Athelstan then demonstrated that > we could match all 3 and 4 place truth functional connective truth table > with no obvious limit to what we could handle in larger sizes being > found. The form translated as "1 from the set {coffee, tea} AND 1 from the > set {sugar, cream} is an example of this solution. sumti sets can include > sets of propositions by using du'u or la'elu/li'u, which I think solves the > first problem. > Yes, but the language uses were never written up (unless in a short bit in the newsletter) and are not in the Book. There are no specimens that I can find anywhere and Athelstan's proof even is lost from the material I have -- can you resurrect it? It is easy to see how the "exactly n" cases work, but what about more complex ones that lay out interrelationships among what occurs or does not? --part1_8.184396a3.28a47c23_boundary Content-Type: text/html; charset="US-ASCII" Content-Transfer-Encoding: 7bit In a message dated 8/9/2001 4:01:41 PM Central Daylight Time,
lojbab@lojban.org writes:


Actually it did.  lu'a for selecting individuals from a set came *directly*
from your posing this problem to me back in 1989 or so.  The other members
of lu'a were added later.  I believe that Athelstan then demonstrated that
we could match all 3 and 4 place truth functional connective truth table
with no obvious limit to what we could handle in larger sizes being
found.  The form translated as "1 from the set {coffee, tea} AND 1 from the
set {sugar, cream} is an example of this solution.  sumti sets can include
sets of propositions by using du'u or la'elu/li'u, which I think solves the
first problem.

Yes, but the language uses were never written up (unless in a short bit in
the newsletter) and are not in the Book.  There are no specimens that I can
find anywhere and Athelstan's proof even is lost from the material I have --
can you resurrect it?   It is easy to see how the "exactly n" cases work, but
what about more complex ones that lay out interrelationships among what
occurs or does not?
--part1_8.184396a3.28a47c23_boundary--