Received: from mail-wg0-f63.google.com ([74.125.82.63]:37215) by stodi.digitalkingdom.org with esmtps (TLSv1:RC4-SHA:128) (Exim 4.80.1) (envelope-from ) id 1XfbR0-0000Sm-Oh for lojban-list-archive@lojban.org; Sat, 18 Oct 2014 14:21:16 -0700 Received: by mail-wg0-f63.google.com with SMTP id m15sf219045wgh.8 for ; Sat, 18 Oct 2014 14:21:04 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=googlegroups.com; s=20120806; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :x-original-sender:x-original-authentication-results:reply-to :precedence:mailing-list:list-id:list-post:list-help:list-archive :sender:list-subscribe:list-unsubscribe:content-type; bh=q9DjIiwLsGlmSyO1ucK3xG403oHiHCaGDJDPvKPoClI=; b=taf6u6T9pYUvfs3EFp3/RSHkSp8Dz0ZT1kBlu/5xDAdMYUGP2r34widOhuSIS+uSRL TD2w/V4WiErvkwi8TtCwfqY5R3uetQGBrBNnOkpIp1gkO5hrG1+QOM2I8iaXJDLbuoBb NgBlrwd7crRhM++GesQmtm2gNkUKyyM5WyxPEhHuYPQ+oE2gInxWDuGFxgFPnHZYi53Y m7mJIFSxWmiRbkhFWzpTY60+cEL3W2VMxJxRdG4XDaehUJuJIcLY5MiCMrApGYwfgvS9 u4xSswuwTAXUSrt6S9O9bkOElbvpY9rVYk8sn+Y09vwrQRUdadyuO6FaUxvC+MOKx2rI 94DQ== X-Received: by 10.152.207.2 with SMTP id ls2mr192190lac.1.1413667263904; Sat, 18 Oct 2014 14:21:03 -0700 (PDT) X-BeenThere: lojban@googlegroups.com Received: by 10.152.9.130 with SMTP id z2ls345877laa.61.gmail; Sat, 18 Oct 2014 14:21:02 -0700 (PDT) X-Received: by 10.112.138.202 with SMTP id qs10mr2594019lbb.5.1413667262465; Sat, 18 Oct 2014 14:21:02 -0700 (PDT) Received: from mail-wg0-x22b.google.com (mail-wg0-x22b.google.com. [2a00:1450:400c:c00::22b]) by gmr-mx.google.com with ESMTPS id ca20si153816wib.3.2014.10.18.14.21.02 for (version=TLSv1 cipher=ECDHE-RSA-RC4-SHA bits=128/128); Sat, 18 Oct 2014 14:21:02 -0700 (PDT) Received-SPF: pass (google.com: domain of jjllambias@gmail.com designates 2a00:1450:400c:c00::22b as permitted sender) client-ip=2a00:1450:400c:c00::22b; Received: by mail-wg0-f43.google.com with SMTP id m15so3035051wgh.14 for ; Sat, 18 Oct 2014 14:21:02 -0700 (PDT) MIME-Version: 1.0 X-Received: by 10.194.122.231 with SMTP id lv7mr20859265wjb.27.1413667262323; Sat, 18 Oct 2014 14:21:02 -0700 (PDT) Received: by 10.217.105.201 with HTTP; Sat, 18 Oct 2014 14:21:02 -0700 (PDT) In-Reply-To: <20141018180946.GF20049@gonzales> References: <20141012012427.GF23876@gonzales> <20141012173533.GG23876@gonzales> <20141014010742.GF19061@gonzales> <20141015005542.GC3713@gonzales> <20141018004531.GE20049@gonzales> <20141018180946.GF20049@gonzales> Date: Sat, 18 Oct 2014 18:21:02 -0300 Message-ID: Subject: Re: [lojban] Re: tersmu 0.2 From: =?UTF-8?Q?Jorge_Llamb=C3=ADas?= To: lojban@googlegroups.com X-Original-Sender: jjllambias@gmail.com X-Original-Authentication-Results: gmr-mx.google.com; spf=pass (google.com: domain of jjllambias@gmail.com designates 2a00:1450:400c:c00::22b as permitted sender) smtp.mail=jjllambias@gmail.com; dkim=pass header.i=@gmail.com; dmarc=pass (p=NONE dis=NONE) header.from=gmail.com Reply-To: lojban@googlegroups.com Precedence: list Mailing-list: list lojban@googlegroups.com; contact lojban+owners@googlegroups.com List-ID: X-Google-Group-Id: 1004133512417 List-Post: , List-Help: , List-Archive: , List-Unsubscribe: , Content-Type: multipart/alternative; boundary=089e01228d440063cd0505b90f57 X-Spam-Score: -1.9 (-) X-Spam_score: -1.9 X-Spam_score_int: -18 X-Spam_bar: - --089e01228d440063cd0505b90f57 Content-Type: text/plain; charset=UTF-8 On Sat, Oct 18, 2014 at 3:09 PM, Martin Bays wrote: > > While, if you'll excuse me reiterating, I would say that given the > profusion of logical connectives and other bridi operators throughout > the language, it's better to give abstract rules which cover many cases > uniformly rather than think in terms of specific rules for each > situation; so in this case I would explain the situation with two rules: > (i) a bridi operator operates on the bridi immediately under > construction, i.e. the lowest in the tree; > (ii) a logical connective acts as a bridi operator, connecting the > two formulae obtained by substituting each connectand in turn > for the connected element. > That's fine, but we still need to identify what "the bridi immediately under construction" is. > ) or we can say that there are no atomic functions, all functions are > > in fact built out of predicates. In this case, we just need to express > > the function in terms of a predicate, and then apply the rule we > > already have for "ko'a .e ko'e" as a pseudo-argument of an atomic > > predicate. > > If I understand correctly, (i) and (ii) also explain these semantics; > the only difference is in whether LAhE introduces a bridi of its own. > Right, so for each context in which "ko'a .e ko'e" may appear, we need to know whether the context introduces a bridi of its own. As I see it, having to know that is tantamount to having a rule for each context. > Hmm... hold on, in {lo tu'o boi re lo mlatu}, we have to parse {re lo > mlatu} first as {re da poi me lo mlatu}. So I don't think any remei are > really involved. > > If we assume that {lo [quantifier]} does introduce a sub-bridi, I guess > I'd expect > lo tu'o boi re lo mlatu .a ci lo gerku > -> lo poi'i me re lo mlatu .a ci lo gerku > -> lo poi'i ga me re lo mlatu gi me ci lo gerku > -> lo poi'i ga re da poi me lo mlatu zo'u ke'a me da gi ci da poi me lo > gerku zo'u ke'a me da > (which is a rather bizarre thing to refer to!). > You're right. This is one more argument for cardinal numbers being plural quantifiers rather than singular. > We cannot claim that the rule for operand-3 always returns true logical > > operands, in the way that we could claim that sumti-6 (almost) always > > returns true logical sumti. "gek operand gik operand-3" is an operand-3, > > for example. > > I would say that 'sumti' always returns a term, and so does 'operand', > where "term" is meant in the sense of logic, and where "returning" is > something that only makes sense in the context of the full parsing > algorithm, but is such that e.g. {ko'a .e ko'e} returns what ko'a is > bound to to one branch, while returning what ko'e is bound to to the > other branch - where these "branches" are what are created by the > semantics of logical connectives as in (ii) above. Similarly, {ro da} > returns the variable quantified over by the quantifier it introduces. > What I meant is that "sumti-6" need not contain any quantifiers or connectives operating on a bridi external to sumti-6, whereas the same can't be said for "operand-3". That's assuming that "li pa .a re" is not "li pa .a li re". > > So, I would not want to insist that "mo'e ko'a .e ko'e" is a logical > > operand, and indeed in my example I was not taking it as one. Since > > sumti and operands are logically the same thing, I was just ignoring > > "mo'e" and "li", and the question was whether "ko'a .e ko'e" operates > > on the predicate "sinso" or on the predicate containing the li-clause > > as its argument. > > OK; so in other words you're taking {mo'e} to be transparent, i.e. not > to introduce a sub-bridi, but for the production 'mex' to be opaque and > to introduce a sub-bridi corresponding to the predicate "is the result > of applying [operator] to [operands]"? > I don't really know how mex work, so I'm only asking questions at this point. I would expect that "na'u sinso mo'e ko'a .e mo'e ko'e" within mex would work in the same way as "lo sinso be ko'a .e ko'e" outside of mex. I take "na'u" to be the mex equivalent of "lo", since it converts a predicate into a function. I don't know exactly why the language needs a parallel mex sub-language, but if it's going to have one it should at least work as closely as possible to how the main language works. If "na'u sinso" does not introduce a bridi of its own, why would "lo sinso be", which has the same meaning, do? > So this handling of {mo'e ko'a .e ko'e} involves a "new rule"? > Yes, "mo'e" converts a (logical) sumti into a (logical) operand, i.e. it doesn't really do anything meaningful since logically a sumti and an operand are the same thing. All it does is take a term from the standard form of the language and put it in a from that can be used within mex. We do need to specify as an additional rule what happens when instead of giving it a logical sumti we give it a pseudo-sumti, something that is morphologically a sumti but logically something else. Since operands also have their corresponding pseudo-operands, it might very well make sense to say that "mo'e" also converts pseudo-sumti into their corresponding pseudo-operand, i.e. that "mo'e ko'a .e ko'e" is "mo'e ko'a .e mo'e ko'e"' Now "mo'e ro da" would be the way to do quantification within mex (though there's no pseudo-operand corresponding to "ro da" in the way that "mo'e ko'a .e mo'e ko'e" corresponds to "ko'a .e ko'e"). Not sure what it could be used for though, since mex only has terms, no formulas. But then the argument for "mo'e" would seem to apply just as well to "li" for the reverse direction, in which case "li pa .a re" would have to be "li pa .a li re". This unfortunately makes li-clauses break the sumti-6 being pure terms rule. > > Well, I'm not advocating this but we know that "na ku zo'u broda" > expresses > > the negation of the proposition expressed by "broda", so it would not be > > out of the question to say that "na ku zo'u tu'e broda .i brode tu'u" > > expresses the negations of both propositions, rather than just the > negation > > of their conjunction. The operator "na ku zo'u" is only well defined when > > applied to a single proposition. When applied to multiple propositions at > > once, who knows how we want it to act. Maybe it should be distributive. > > I guess it could! Yet another thing to be decided. Do you think it might > be a bad idea to decide that it's equivalent to "na ku go broda gi > brode"? > Why "go"? That would mean that one of the propositions is true and the other false. What would be the generalization to "na ku zo'u tu'e broda .i brode .i brodi tu'u"? Or did you mean "ga"? mu'o mi'e xorxes -- You received this message because you are subscribed to the Google Groups "lojban" group. To unsubscribe from this group and stop receiving emails from it, send an email to lojban+unsubscribe@googlegroups.com. To post to this group, send email to lojban@googlegroups.com. Visit this group at http://groups.google.com/group/lojban. For more options, visit https://groups.google.com/d/optout. --089e01228d440063cd0505b90f57 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable

= On Sat, Oct 18, 2014 at 3:09 PM, Martin Bays <mbays@sdf.org> wr= ote:

While, if you= 9;ll excuse me reiterating, I would say that given the
profusion of logical connectives and other bridi operators throughout
the language, it's better to give abstract rules which cover many cases=
uniformly rather than think in terms of specific rules for each
situation; so in this case I would explain the situation with two rules: =C2=A0 =C2=A0 (i) a bridi operator operates on the bridi immediately under<= br> =C2=A0 =C2=A0 =C2=A0 =C2=A0 construction, i.e. the lowest in the tree;
=C2=A0 =C2=A0 (ii) a logical connective acts as a bridi operator, connectin= g the
=C2=A0 =C2=A0 =C2=A0 =C2=A0 two formulae obtained by substituting each conn= ectand in turn
=C2=A0 =C2=A0 =C2=A0 =C2=A0 for the connected element.

That's fine, but we still need to identify what "t= he bridi immediately under construction" is. =C2=A0

> ) or we can say that there are no atomic functions, all functions are<= br> > in fact built out of predicates. In this case, we just need to express=
> the function in terms of a predicate, and then apply the rule we
> already have for "ko'a .e ko'e" as a pseudo-argument= of an atomic
> predicate.

If I understand correctly, (i) and (ii) also explain these semantics= ;
the only difference is in whether LAhE introduces a bridi of its own.

Right, so for each context in which "ko= 'a .e ko'e" may appear, we need to know whether the context in= troduces a bridi of its own. As I see it, having to know that is tantamount= to having a rule for each context.
=C2=A0
= Hmm... hold on, in {lo tu'o boi re lo mlatu}, we have to parse {re lo mlatu} first as {re da poi me lo mlatu}. So I don't think any remei are=
really involved.

If we assume that {lo [quantifier]} does introduce a sub-bridi, I guess
I'd expect
=C2=A0 =C2=A0 lo tu'o boi re lo mlatu .a ci lo gerku
-> lo poi'i me re lo mlatu .a ci lo gerku
-> lo poi'i ga me re lo mlatu gi me ci lo gerku
-> lo poi'i ga re da poi me lo mlatu zo'u ke'a me da gi ci d= a poi me lo
=C2=A0 =C2=A0 gerku zo'u ke'a me da
(which is a rather bizarre thing to refer to!).

You're right. This is one more argument for cardinal numbers b= eing plural quantifiers rather than singular.

> We cannot claim that the rule for operand-3 always returns true logica= l
> operands, in the way that we could claim that sumti-6 (almost) always<= br> > returns true logical sumti. "gek operand gik operand-3" is a= n operand-3,
> for example.

I would say that 'sumti' always returns a term, and so does = 'operand',
where "term" is meant in the sense of logic, and where "retu= rning" is
something that only makes sense in the context of the full parsing
algorithm, but is such that e.g. {ko'a .e ko'e} returns what ko'= ;a is
bound to to one branch, while returning what ko'e is bound to to the other branch - where these "branches" are what are created by the=
semantics of logical connectives as in (ii) above. Similarly, {ro da}
returns the variable quantified over by the quantifier it introduces.

What I meant is that "sumti-6" nee= d not contain any quantifiers or connectives operating on a bridi external = to sumti-6, whereas the same can't be said for "operand-3". T= hat's assuming that "li pa .a re" is not "li pa .a li re= ".=C2=A0

=C2=A0
> So, I would not want to insist that "mo'e ko'a .e ko'= e" is a logical
> operand, and indeed in my example I was not taking it as one. Since > sumti and operands are logically the same thing, I was just ignoring > "mo'e" and "li", and the question was whether = "ko'a .e ko'e" operates
> on the predicate "sinso" or on the predicate containing the = li-clause
> as its argument.

OK; so in other words you're taking {mo'e} to be transparent= , i.e. not
to introduce a sub-bridi, but for the production 'mex' to be opaque= and
to introduce a sub-bridi corresponding to the predicate "is the result=
of applying [operator] to [operands]"?

=
I don't really know how mex work, so I'm only asking questions= at this point. I would expect that "na'u sinso mo'e ko'a = .e mo'e ko'e" within mex would work in the same way as "l= o sinso be ko'a .e ko'e" outside of mex. I take "na'u= " to be the mex equivalent of "lo", since it converts a pred= icate into a function. I don't know exactly why the language needs a pa= rallel mex sub-language, but if it's going to have one it should at lea= st work as closely as possible to how the main language works. If "na&= #39;u sinso" does not introduce a bridi of its own, why would "lo= sinso be", which has the same meaning, do?
=C2=A0
So this handling of {mo'e ko'a .e ko'e} involves a "new ru= le"?

Yes, "mo'e" con= verts a (logical) sumti into a (logical) operand, i.e. it doesn't reall= y do anything meaningful since logically a sumti and an operand are the sam= e thing. All it does is take a term from the standard form of the language = and put it in a from that can be used within mex. We do need to specify as = an additional rule what happens when instead of giving it a logical sumti w= e give it a pseudo-sumti, something that is morphologically a sumti but log= ically something else. Since operands also have their corresponding pseudo-= operands, it might very well make sense to say that "mo'e" al= so converts pseudo-sumti into their corresponding pseudo-operand, i.e. that= "mo'e ko'a .e ko'e" is "mo'e ko'a .e mo= 'e ko'e"'

Now "mo'e ro d= a" would be the way to do quantification within mex (though there'= s no pseudo-operand corresponding to "ro da" in the way that &quo= t;mo'e ko'a .e mo'e ko'e" corresponds to "ko'= a .e ko'e"). Not sure what it could be used for though, since mex = only has terms, no formulas.

But then the argument= for "mo'e" would seem to apply just as well to "li"= ; for the reverse direction, in which case "li pa .a re" would ha= ve to be "li pa .a li re". This unfortunately makes li-clauses br= eak the sumti-6 being pure terms rule.
=C2=A0
> Well, I'm not advocating this but we know that= "na ku zo'u broda" expresses
> the negation of the proposition expressed by "broda", so it = would not be
> out of the question to say that "na ku zo'u tu'e broda .i= brode tu'u"
> expresses the negations of both propositions, rather than just the neg= ation
> of their conjunction. The operator "na ku zo'u" is only = well defined when
> applied to a single proposition. When applied to multiple propositions= at
> once, who knows how we want it to act. Maybe it should be distributive= .

I guess it could! Yet another thing to be decided. Do you think it m= ight
be a bad idea to decide that it's equivalent to "na ku go broda gi=
brode"?

Why "go"?= That would mean that one of the propositions is true and the other false. = What would be the generalization to "na ku zo'u tu'e broda .i = brode .i brodi tu'u"? Or did you mean "ga"?

mu'o mi'e = xorxes

--
You received this message because you are subscribed to the Google Groups &= quot;lojban" group.
To unsubscribe from this group and stop receiving emails from it, send an e= mail to lojban+unsub= scribe@googlegroups.com.
To post to this group, send email to lojban@googlegroups.com.
Visit this group at http:= //groups.google.com/group/lojban.
For more options, visit http= s://groups.google.com/d/optout.
--089e01228d440063cd0505b90f57--