Received: from mail-qc0-f191.google.com ([209.85.216.191]:40068) by stodi.digitalkingdom.org with esmtps (TLSv1:RC4-SHA:128) (Exim 4.80.1) (envelope-from ) id 1XmJxl-0001MC-MS; Thu, 06 Nov 2014 02:06:50 -0800 Received: by mail-qc0-f191.google.com with SMTP id l6sf107360qcy.8 for ; Thu, 06 Nov 2014 02:06:39 -0800 (PST) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=googlegroups.com; s=20120806; h=date:from:to:cc:message-id:in-reply-to:references:subject :mime-version:x-original-sender:reply-to:precedence:mailing-list :list-id:list-post:list-help:list-archive:sender:list-subscribe :list-unsubscribe:content-type; bh=kv9tIO6/MoPOETD4rxaqaRv6a4pNHjTfFxM6A+aC82o=; b=hKv9rsVe5Kr0rFuavXqDRTskONFmNwG2W26qBzFo6ik/SpSAnA2n5Ri2Wq0Nny5+45 IgwVTtYWzgUl/sAT7AZJcZfSERBBAucnLdRARIxCy5X8NRZG+A2L2RZ4I/A+rAcA5191 ivKCHL9X5rXGgUbTfwFt/0mpXgmdEWbxvZN9GQpNfmlHsTlUohtviwNBUQfp6X5zYpeb vJ3Q9a3qTMC0FIII1T8NDIcKccYWVhm3IqJwMzIhPRas/hp6vHXwFFjbBeyJZD1XqiOB 6UeBiqYDBZj/DcDDR3EOCVDhy6xr6g5rb9Dnxw8mXaFqWvQ3K3daaChxOJtNN8HPe03I nWvg== X-Received: by 10.50.107.3 with SMTP id gy3mr23736igb.10.1415268398925; Thu, 06 Nov 2014 02:06:38 -0800 (PST) X-BeenThere: bpfk-list@googlegroups.com Received: by 10.107.19.218 with SMTP id 87ls436059iot.35.gmail; Thu, 06 Nov 2014 02:06:38 -0800 (PST) X-Received: by 10.42.245.5 with SMTP id ls5mr8575446icb.7.1415268398757; Thu, 06 Nov 2014 02:06:38 -0800 (PST) Received: by 10.224.72.140 with SMTP id m12msqaj; Wed, 5 Nov 2014 23:40:38 -0800 (PST) X-Received: by 10.182.214.34 with SMTP id nx2mr15506obc.17.1415259638569; Wed, 05 Nov 2014 23:40:38 -0800 (PST) Date: Wed, 5 Nov 2014 23:40:37 -0800 (PST) From: Ozymandias Haynes To: bpfk-list@googlegroups.com Cc: cowan@mercury.ccil.org Message-Id: In-Reply-To: <20141019170808.GJ12991@mercury.ccil.org> References: <20141018011419.GF12268@mercury.ccil.org> <97AABFB42A204E5D97A4EDFEA57A8508@gmail.com> <20141019012930.GF12991@mercury.ccil.org> <676B49242B0D4F6A986D6AFEA1EB3B3C@gmail.com> <20141019170808.GJ12991@mercury.ccil.org> Subject: Re: [bpfk] {ro}, existential import and De Morgan MIME-Version: 1.0 X-Original-Sender: ozymandias.haynes@gmail.com Reply-To: bpfk-list@googlegroups.com Precedence: list Mailing-list: list bpfk-list@googlegroups.com; contact bpfk-list+owners@googlegroups.com List-ID: X-Google-Group-Id: 972099695765 List-Post: , List-Help: , List-Archive: , List-Unsubscribe: , Content-Type: multipart/alternative; boundary="----=_Part_4656_903537287.1415259637868" X-Spam-Score: -1.9 (-) X-Spam_score: -1.9 X-Spam_score_int: -18 X-Spam_bar: - Content-Length: 18749 ------=_Part_4656_903537287.1415259637868 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: quoted-printable Hi everyone. la mukti asked me to weigh in on this. I=E2=80=99ve given it= a good=20 bit of thought, as it=E2=80=99s one of the two most serious problems in Loj= ban=20 foundations as defined in the CLL. la mukti's analysis is excellent; his simple unicorn sentences demonstrate= =20 the contradiction in action and the connection to Aristotelian logic=20 explains how importation might have crept in. This association with=20 Aristotle also provides an argument against importation. Modern logic has= =20 simply left Aristotle behind, as should, in my opinion, any conlang built= =20 on the developments in logic from the last century. Furthermore, it's not quite right to say that the CLL simply chooses to use= =20 Aristotelian logic in this one case. This is because in Aristotelian logic= =20 there are no quantifiers as they are understood in predicate logic (or in= =20 Lojban). In fact this is one of the limitations of Aristotle's rules for= =20 reasoning: it ignored a lot of the inner structure of the statements=20 involved and so could not account for the relationships between the objects= =20 involved in the statements. So importing ro here is not actually=20 historical, but anachronistic. The CLL definition essentially creates a=20 bizarre hybrid of Aristotelian and predicate logic which no one uses.=20 Incompatibility with the classical negation theorem is one way this break= =20 is showing up. Aristotle would not have said that when moving the negation= =20 sign across bound variables you must flip the quantifier to preserve truth= =20 values because those things weren't part of his system at all. There are only three choices here as I see it. We can use the standard=20 semantics from predicate logic for the universal quantifier and keep the=20 standard negation theorem; or we can keep importing ro and lose the=20 negation theorem; or we can do nothing and allow an internal contradiction= =20 to lie in the foundations of Lojban. A strong argument in favor of=20 importing ro would include an account of the way negation works in this new= =20 system. Although I am solidly in favor of non-importing ro, I will sketch= =20 out how to do that in a moment. But first I'd like to examine John's point= . The way that "All unicorns are white." is represented in predicate logic is= =20 with the formula $$ \forall x : [ U(x) \rightarrow W(x) ] $$. (The stuff= =20 between the dollar signs is LaTeX markup; if you can't read it you can plug= =20 it into an online renderer. \forall is the universal quantifier, x is the= =20 bound variable, \rightarrow is implication, and U and W are functions=20 corresponding to 'x is a unicorn' and 'x is white' resp.). As John says,= =20 one way to translate this into Lojban is "ro da zo'u ganai da pavyseljirna= =20 gi da blabi". This is irrelevant to la mukti's construction, however. He= =20 did not use that Lojban sentence in his example, he used one that's=20 formally equivalent to da with poi. The negation theorem is stated in its= =20 full generality in the CLL and not only on sentences of the form above.=20 Indeed, using that implication form as a definition of "ro da poi X" is=20 precisely what is needed to fit with the negation theorem and with=20 predicate logic, and those are precisely the semantics that I am advocating= . It=E2=80=99s easy to see that these sentences are consistent with the negat= ion=20 theorem. Recall that a logical implication is a function of statements;=20 it's truth value depends only on the truth value of the statements it acts= =20 on. An IF (...) THEN (...) statement is defined to be false when the first= =20 argument, called the antecedent, is true and the second argument, called=20 the consequent, is false. All other pairs of arguments result in true. Under our assumption that nothing satisfies pavyseljirna, "ro da zo'u ganai= =20 da pavyseljirna gi da blabi" is true because for every value of da, the=20 antecedent is false. Therefore "naku ro da zo'u ganai da pavyseljirna gi= =20 da blabi" is false. According to the negation theorem "su'o da naku zo'u= =20 ganai da pavyseljirna gi da blabi" must also be false. This says that=20 there must an object which falsifies the implication, and as I said in the= =20 last paragraph this can only happen when the antecedent is true and the=20 consequent false. The antecedent claims that x is a unicorn, so a true=20 antecedent would contradict our assumption about unicorns. Of course the= =20 particular functions we chose, unicorns and white, are not important; all= =20 statements of this form are consistent with the negation theorem. So if we wanted to keep the importing semantics, how would negation have to= =20 work? We first rewrite "ro da poi P" in the importing sense as a formula= =20 in predicate logic to manipulate it symbolically, then translate it back=20 into Lojban. This still uses the implication, but includes the additional= =20 restriction that something must satisfy P. We therefore represent "naku ro= =20 da poi P zo=E2=80=99u Q" as $$ \neg \forall x \exists y : P(y) \land [P(x)= =20 \rightarrow Q(x)]) $$. Applying the theorem to the formula, we get $$=20 \exists x \forall y : \neg (P(y) \land [P(x) \rightarrow Q(x)]) $$ which is= =20 equivalent by another elementary theorem to $$ \exists x \forall y : \neg= =20 P(y) \lor \neg (P(x) \rightarrow Q(x)) $$ which can be translated back into= =20 Lojban as =E2=80=9Cro da su=E2=80=99o de zo=E2=80=99u de P inajanai ganai d= a P gi da Q=E2=80=9D. Notice in=20 particular that there are now two sumti involved. This is because in the= =20 importing sense there are really two different claims being made and each= =20 use their own variable. I played with this for about half an hour tonight= =20 and couldn=E2=80=99t find an equivalent form that resulted in more elegant = Lojban;=20 perhaps an importing advocate can do better. That=E2=80=99s one of four cases; three others are treated similarly, and t= hen=20 negation dragging across unrestricted da operates according to the normal= =20 rules. Imagine trying to move naku around in an ordinary sentence under=20 these rules! I don=E2=80=99t know what pc said to John but it is simply not true that th= e=20 Aristotelian sense of =E2=80=9CAll P are Q=E2=80=9D is compatible with pred= icate logic. On=20 page 54 of Hilbert and Ackermann=E2=80=99s classic _Principles of Mathemati= cal=20 Logic_ appears the following: =E2=80=9CAccording to Aristotle the sentence =E2=80=98All A is B=E2=80=99 i= s valid only when there=20 are objects which are A. Our deviation from Aristotle in this respect is= =20 justified by the mathematical applications of logic, in which the=20 Aristotelian interpretation would not be useful.=E2=80=9D Its possible that there is some confusion over an elementary theorem which= =20 states $$ \forall x : P(x) $$ implies $$ \exists x : P(x) $$. If we look= =20 closely at that we see that, in John=E2=80=99s words, the quantification th= ere=20 corresponds to Lojban=E2=80=99s unrestricted logical variables; restricted = logical=20 variables must first be rewritten as pure formulae, as I did above, before= =20 applying the theorem. mi=E2=80=99e az On Sunday, October 19, 2014 10:08:14 AM UTC-7, John Cowan wrote: > > Alex Burka scripsit:=20 > > > Ok, so just to clarify what you were correcting, with importing {ro}=20 > > you would say {ro broda cu brode} and {ro da poi broda cu brode} are=20 > > the same thing and require {su'o da broda}, while {ro da ganai broda=20 > > gi brode} is different and just requires a non-empty universe?=20 > > Right. The difference is between restricted and unrestricted=20 > quantification.=20 > > --=20 > John Cowan http://www.ccil.org/~cowan co...@ccil.org=20 > =20 > Lope de Vega: "It wonders me I can speak at all. Some caitiff rogue=20 > did rudely yerk me on the knob, wherefrom my wits yet wander."=20 > An Englishman: "Ay, belike a filchman to the nab'll leave you=20 > crank for a spell." --Harry Turtledove, Ruled Britannia=20 > --=20 You received this message because you are subscribed to the Google Groups "= BPFK" group. To unsubscribe from this group and stop receiving emails from it, send an e= mail to bpfk-list+unsubscribe@googlegroups.com. To post to this group, send email to bpfk-list@googlegroups.com. Visit this group at http://groups.google.com/group/bpfk-list. For more options, visit https://groups.google.com/d/optout. ------=_Part_4656_903537287.1415259637868 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable
Hi everyone.  la mukti asked me to weigh in on t= his.  I=E2=80=99ve given it a good bit of thought, as it=E2=80=99s one= of the two most serious problems in Lojban foundations as defined in the C= LL.

la mukti's analysis is excellent; his simple u= nicorn sentences demonstrate the contradiction in action and the connection= to Aristotelian logic explains how importation might have crept in.  = This association with Aristotle also provides an argument against importati= on.  Modern logic has simply left Aristotle behind, as should, in my o= pinion, any conlang built on the developments in logic from the last centur= y.

Furthermore, it's not quite right to say that t= he CLL simply chooses to use Aristotelian logic in this one case.  Thi= s is because in Aristotelian logic there are no quantifiers as they are und= erstood in predicate logic (or in Lojban).  In fact this is one of the= limitations of Aristotle's rules for reasoning: it ignored a lot of the in= ner structure of the statements involved and so could not account for the r= elationships between the objects involved in the statements.  So impor= ting ro here is not actually historical, but anachronistic.  The CLL d= efinition essentially creates a bizarre hybrid of Aristotelian and predicat= e logic which no one uses.  Incompatibility with the classical negatio= n theorem is one way this break is showing up.  Aristotle would not ha= ve said that when moving the negation sign across bound variables you must = flip the quantifier to preserve truth values because those things weren't p= art of his system at all.

There are only three cho= ices here as I see it.  We can use the standard semantics from predica= te logic for the universal quantifier and keep the standard negation theore= m; or we can keep importing ro and lose the negation theorem; or we can do = nothing and allow an internal contradiction to lie in the foundations of Lo= jban.  A strong argument in favor of importing ro would include an acc= ount of the way negation works in this new system.  Although I am soli= dly in favor of non-importing ro, I will sketch out how to do that in a mom= ent.  But first I'd like to examine John's point.

=
The way that "All unicorns are white." is represented in predicate log= ic is with the formula $$ \forall x : [ U(x) \rightarrow W(x) ] $$.  (= The stuff between the dollar signs is LaTeX markup; if you can't read it yo= u can plug it into an online renderer. \forall is the universal quantifier,= x is the bound variable, \rightarrow is implication, and U and W are funct= ions corresponding to 'x is a unicorn' and 'x is white' resp.).  As Jo= hn says, one way to translate this into Lojban is "ro da zo'u ganai da pavy= seljirna gi da blabi".  This is irrelevant to la mukti's construction,= however.  He did not use that Lojban sentence in his example, he used= one that's formally equivalent to da with poi.  The negation theorem = is stated in its full generality in the CLL and not only on sentences of th= e form above.  Indeed, using that implication form as a definition of = "ro da poi X" is precisely what is needed to fit with the negation theorem = and with predicate logic, and those are precisely the semantics that I am a= dvocating.

It=E2=80=99s easy to see that these sen= tences are consistent with the negation theorem.  Recall that a logica= l implication is a function of statements; it's truth value depends only on= the truth value of the statements it acts on.  An IF (...) THEN (...)= statement is defined to be false when the first argument, called the antec= edent, is true and the second argument, called the consequent, is false. &n= bsp;All other pairs of arguments result in true.

U= nder our assumption that nothing satisfies pavyseljirna, "ro da zo'u ganai = da pavyseljirna gi da blabi" is true because for every value of da, the ant= ecedent is false.  Therefore "naku ro da zo'u ganai da pavyseljirna gi= da blabi" is false.  According to the negation theorem "su'o da naku = zo'u ganai da pavyseljirna gi da blabi" must also be false.  This says= that there must an object which falsifies the implication, and as I said i= n the last paragraph this can only happen when the antecedent is true and t= he consequent false.  The antecedent claims that x is a unicorn, so a = true antecedent would contradict our assumption about unicorns.  Of co= urse the particular functions we chose, unicorns and white, are not importa= nt; all statements of this form are consistent with the negation theorem.

So if we wanted to keep the importing semantics, ho= w would negation have to work?  We first rewrite "ro da poi P" in the = importing sense as a formula in predicate logic to manipulate it symbolical= ly, then translate it back into Lojban.  This still uses the implicati= on, but includes the additional restriction that something must satisfy P. =  We therefore represent "naku ro da poi P zo=E2=80=99u Q" as $$ \neg \= forall x \exists y : P(y) \land [P(x) \rightarrow Q(x)]) $$.  Applying= the theorem to the formula, we get $$ \exists x \forall y : \neg (P(y) \la= nd [P(x) \rightarrow Q(x)]) $$ which is equivalent by another elementary th= eorem to $$ \exists x \forall y : \neg P(y) \lor \neg (P(x) \rightarrow Q(x= )) $$ which can be translated back into Lojban as =E2=80=9Cro da su=E2=80= =99o de zo=E2=80=99u de P inajanai ganai da P gi da Q=E2=80=9D.  Notic= e in particular that there are now two sumti involved.  This is becaus= e in the importing sense there are really two different claims being made a= nd each use their own variable.  I played with this for about half an = hour tonight and couldn=E2=80=99t find an equivalent form that resulted in = more elegant Lojban; perhaps an importing advocate can do better.

That=E2=80=99s one of four cases; three others are treated = similarly, and then negation dragging across unrestricted da operates accor= ding to the normal rules.  Imagine trying to move naku around in an or= dinary sentence under these rules!

I don=E2=80=99t= know what pc said to John but it is simply not true that the Aristotelian = sense of =E2=80=9CAll P are Q=E2=80=9D is compatible with predicate logic. =  On page 54 of Hilbert and Ackermann=E2=80=99s classic _Principles of = Mathematical Logic_ appears the following:

=E2=80= =9CAccording to Aristotle the sentence =E2=80=98All A is B=E2=80=99 is vali= d only when there are objects which are A.  Our deviation from Aristot= le in this respect is justified by the mathematical applications of logic, = in which the Aristotelian interpretation would not be useful.=E2=80=9D

Its possible that there is some confusion over an elem= entary theorem which states $$ \forall x : P(x) $$ implies $$ \exists x : P= (x) $$.  If we look closely at that we see that, in John=E2=80=99s wor= ds, the quantification there corresponds to Lojban=E2=80=99s unrestricted l= ogical variables; restricted logical variables must first be rewritten as p= ure formulae, as I did above, before applying the theorem.

mi=E2=80=99e az


On Sunday, October 19, 201= 4 10:08:14 AM UTC-7, John Cowan wrote:
Alex Burka scripsit:

> Ok, so just to clarify what you were correcting, with importing {r= o}
> you would say {ro broda cu brode} and {ro da poi broda cu brode} a= re
> the same thing and require {su'o da broda}, while {ro da ganai bro= da
> gi brode} is different and just requires a non-empty universe?

Right.  The difference is between restricted and unrestricted quan= tification.

--=20
John Cowan          ht= tp://www.ccil.org/~cowan        co...@ccil.org
Lope de Vega: "It wonders me I can speak at all.  Some caitiff rog= ue
did rudely yerk me on the knob, wherefrom my wits yet wander."
An Englishman: "Ay, belike a filchman to the nab'll leave you
crank for a spell." --Harry Turtledove, Ruled Britannia

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