From LOJBAN@CUVMB.CC.COLUMBIA.EDU Sat Mar 6 22:53:41 2010 Return-Path: Delivered-To: veion@XIRON.PC.HELSINKI.FI Received: (qmail 20462 invoked from network); 26 Sep 1997 14:11:56 -0000 Received: from segate.sunet.se (192.36.125.6) by xiron.pc.helsinki.fi with SMTP; 26 Sep 1997 14:11:56 -0000 Received: from segate.sunet.se by SEGATE.SUNET.SE (LSMTP for OpenVMS v1.1a) with SMTP id <13.59C6E545@SEGATE.SUNET.SE>; Fri, 26 Sep 1997 16:11:46 +0100 Date: Fri, 26 Sep 1997 14:57:35 BST Reply-To: Don Wiggins Sender: Lojban list From: Don Wiggins Subject: Re: RV: na'e entails na? To: LOJBAN@CUVMB.CC.COLUMBIA.EDU Content-Length: 1357 Lines: 42 Message-ID: > If the grammar of po`o is robust enough, that looks like it > could work. (As it stands, it looks to me as if it groups as > > po`o(na (fraso (selgu`e))) > > because don't UI bind to the previous word? - But if so you can > change it to "na fraso po`o selgu`e".) Yes, as UI it would bind to the previous word. We could also use "po'onai" lo fraso po'onai selgu'e lo ((((fraso) po'o) nai) selgu'e) It is important not to negate the "selgu'e" as well. > But anyway, if the Engdahl-Wiggins "na ..po`o" proposal works, > then I shall give up contesting {na`e}. Trying to be more rigorous, there does appear to be a problem: po'o (f (x)) = f (x) ^ !E f': (f' != f) ^ f' (x) po'onai (f (x)) = !(f (x) ^ !E f': (f' != f) ^ f' (x)) negating = !f (x) V E f': (f' != f) ^ f' (x) by DeMorgan's Notice that first term !f (x). Going back to our example: let the universal be { a, b, c, d, e, f } and fraso (x) = { a, b, c } and glico (x) = { c, d, e } but now !fraso (x) = { d, e, f } po'o (fraso (x)) = { a, b } !(po'o (fraso (x))) = { c, d, e, f } And that f appears were it should be (glico (f) is false and there is no other relation). In terms of logical manipulation, the simpler definitions of "na'e" and "po'o" would be more useful, but these definitions do not correspond to English. ni'oco'omi'e dn.