From pycyn@aol.com Thu Nov 07 05:07:34 2002
Return-Path: <Pycyn@aol.com>
X-Sender: Pycyn@aol.com
X-Apparently-To: lojban@yahoogroups.com
Received: (EGP: mail-8_2_3_0); 7 Nov 2002 13:07:34 -0000
Received: (qmail 4350 invoked from network); 7 Nov 2002 13:07:34 -0000
Received: from unknown (66.218.66.217)
  by m14.grp.scd.yahoo.com with QMQP; 7 Nov 2002 13:07:34 -0000
Received: from unknown (HELO imo-m03.mx.aol.com) (64.12.136.6)
  by mta2.grp.scd.yahoo.com with SMTP; 7 Nov 2002 13:07:34 -0000
Received: from Pycyn@aol.com
  by imo-m03.mx.aol.com (mail_out_v34.13.) id r.78.300a8dd6 (4468)
  for <lojban@yahoogroups.com>; Thu, 7 Nov 2002 08:07:25 -0500 (EST)
Message-ID: <78.300a8dd6.2afbbf8d@aol.com>
Date: Thu, 7 Nov 2002 08:07:25 EST
Subject: Re: [lojban] Re: importing ro
To: lojban@yahoogroups.com
MIME-Version: 1.0
Content-Type: multipart/alternative; boundary="part1_78.300a8dd6.2afbbf8d_boundary"
X-Mailer: AOL 8.0 for Windows US sub 230
From: pycyn@aol.com
X-Yahoo-Group-Post: member; u=2455001
X-Yahoo-Profile: kaliputra

--part1_78.300a8dd6.2afbbf8d_boundary
Content-Type: text/plain; charset="US-ASCII"
Content-Transfer-Encoding: 7bit

In a message dated 11/6/2002 8:16:22 PM Central Standard Time, 
a.rosta@lycos.co.uk writes:
<<
> pc,
> the main instigator and advocate of the Yes answer to Q1, bases
> his reasons on the way things work in logic, but we do not have
> to agree that {da poi} is restricted quantification; we can decree
> that it is not. Anybody who really wants restricted quantification
> and Option B can create appropriate experimental cmavo for it.
>>
Since so many peple have been kind enough to tell me what I think and have 
universally gotten it wrong, allow me to say what I really do think. 
1. There are four fundamental quantifiers in Lojban: {ro, su'o, no, 
me'i[ro]} (I intend to make sure that the default origin for {me'i} is {ro}, 
if it is not already).
2. They are related as follows
subalterns: ro => su'o
no => me'i
contraries: ro => naku no (and so, if you can't do the numbers, no => naku 
ro)
subcontraries: naku su'o => me'i (and so naku me'i => su'o)
contradictories: naku ro <=> me'i
naku su'o <=> no
(and so naku no <=> su'o
naku me'i <=> ro)
When there is a guarantee that the subject term is non-empty, 
no => ro naku
me'i => su'o naku
I assume the universe is non-empy.
Consequently:
naku ro da broda <=> me'i da broda <=> su'o da naku broda
naku su'o da broda <=> no da broda <=> ro da naku broda
(typically, {broda} will in fact be complex -- a conditional with {ro}, a 
conjunction with {su'o} -- ordinary DeMorgan then applies to bring {naku} ti 
its smallest scope).
naku ro broda cu brode <=> me'i broda cu brode 
and so on, as in contraries above. The further move to, in this case, {su'o 
broda naku brode} requires the addition of implicit or explicit evidence that 
lo'i broda is not null.
{ro} imports as always (for the universe or a subject), {no} and {me'i} do 
not. The usual formalae of formal logic continue to operate as usual, but 
are not the only -- or even usual -- ways to say "All S is P" or "Some S is 
P" etc. 

The system with {da} and connectives is definable within the system with only 
predications and conversely, but no particular advantage derives from such 
definitions once the basic rules are in place.

Sentences of the form {Q da poi broda cu brode} occupy an intermediate 
position, since {poi} can be read either as a restrictor on the range of the 
quantifier (the most natural, I think, but I don't insist on it) or as a part 
of the predicate to a universal subject -- that is as {ganai gi} or {ge gi} 
depending on the quantifier. This seems to me the only question left to 
settle. 


--part1_78.300a8dd6.2afbbf8d_boundary
Content-Type: text/html; charset="US-ASCII"
Content-Transfer-Encoding: 7bit

<HTML><FONT FACE=arial,helvetica><BODY BGCOLOR="#ffffff"><FONT style="BACKGROUND-COLOR: #ffffff" SIZE=2 FAMILY="SANSSERIF" FACE="Arial" LANG="0">In a message dated 11/6/2002 8:16:22 PM Central Standard Time, a.rosta@lycos.co.uk writes:<BR>
&lt;&lt;<BR>
<BLOCKQUOTE TYPE=CITE style="BORDER-LEFT: #0000ff 2px solid; MARGIN-LEFT: 5px; MARGIN-RIGHT: 0px; PADDING-LEFT: 5px">pc,<BR>
the main instigator and advocate of the Yes answer to Q1, bases<BR>
his reasons on the way things work in logic, but we do not have<BR>
to agree that {da poi} is restricted quantification; we can decree<BR>
that it is not. Anybody who really wants restricted quantification<BR>
and Option B can create appropriate experimental cmavo for it.</BLOCKQUOTE><BR>
&gt;&gt;<BR>
Since so many peple have been kind enough to tell me what I think and have universally gotten it wrong, allow me to say what I really do think.&nbsp; <BR>
1.&nbsp; There are four fundamental quantifiers in Lojban: {ro, su'o, no, me'i[ro]} (I intend to make sure that the default origin for {me'i} is {ro}, if it is not already).<BR>
2.&nbsp; They are related as follows<BR>
subalterns: ro =&gt; su'o<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; no =&gt; me'i<BR>
contraries: ro =&gt; naku no (and so, if you can't do the numbers, no =&gt; naku ro)<BR>
subcontraries: naku su'o =&gt; me'i (and so naku me'i =&gt; su'o)<BR>
contradictories: naku ro &lt;=&gt; me'i<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; naku su'o &lt;=&gt; no<BR>
(and so&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; naku no &lt;=&gt; su'o<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; naku me'i &lt;=&gt; ro)<BR>
When there is a guarantee that the subject term is non-empty,&nbsp; <BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; no =&gt; ro naku<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; me'i =&gt; su'o naku<BR>
I assume the universe is non-empy.<BR>
Consequently:<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; naku ro da broda &lt;=&gt; me'i da broda &lt;=&gt; su'o da naku broda<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; naku su'o da broda &lt;=&gt; no da broda &lt;=&gt; ro da naku broda<BR>
(typically, {broda} will in fact be complex -- a conditional with {ro}, a conjunction with {su'o} -- ordinary DeMorgan then applies to bring {naku} ti its smallest scope).<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; naku ro broda cu brode &lt;=&gt;&nbsp; me'i broda cu brode <BR>
and so on, as in contraries above.&nbsp; The further move to, in this case, {su'o broda naku brode} requires the addition of implicit or explicit evidence that lo'i broda is not null.<BR>
{ro} imports as always (for the universe or a subject), {no} and {me'i} do not.&nbsp; The usual formalae of formal logic continue to operate as usual, but are not the only -- or even usual -- ways to say "All S is P" or "Some S is P" etc.&nbsp; <BR>
<BR>
The system with {da} and connectives is definable within the system with only predications and conversely, but no particular advantage derives from such definitions once the basic rules are in place.<BR>
<BR>
Sentences of the form {Q da poi broda cu brode} occupy an intermediate position, since {poi} can be read either as a restrictor on the range of the quantifier (the most natural, I think, but I don't insist on it) or as a part of the predicate to a universal subject -- that is as {ganai gi} or {ge gi} depending on the quantifier.&nbsp; This seems to me the only question left to settle. <BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; </FONT></HTML>

--part1_78.300a8dd6.2afbbf8d_boundary--

