Received-SPF: pass (google.com: domain of ilmen.pokebip@gmail.com designates 2a00:1450:400c:c00::230 as permitted sender) client-ip=2a00:1450:400c:c00::230;
Message-ID: <54C80768.7020101@gmail.com>
Date: Tue, 27 Jan 2015 22:47:20 +0100
From: Ilmen <ilmen.pokebip@gmail.com>
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:31.0) Gecko/20100101 Thunderbird/31.4.0
MIME-Version: 1.0
To: lojban@googlegroups.com
Subject: [lojban] {porsi}
Content-Type: multipart/alternative;
 boundary="------------010607000702050300030904"
Reply-To: lojban@googlegroups.com
Precedence: list
Mailing-list: list lojban@googlegroups.com; contact lojban+owners@googlegroups.com
Sender: lojban@googlegroups.com
X-Spam_score: 0.8
X-Spam_score_int: 8
X-Spam_bar: /
X-Spam-Report: Spam detection software, running on the system "stodi.digitalkingdom.org",
 has NOT identified this incoming email as spam.  The original
 message has been attached to this so you can view it or label
 similar future email.  If you have any questions, see
 @@CONTACT_ADDRESS@@ for details.
 
 Content preview:  coi ro do I would like to hear your opinion about the following.
    Can the predicate {porsi} be applied to a sequence <http://en.wikipedia.org/wiki/Sequence>,
    in the sense of an ordered list allowing multiple occurrences of the same
    element, such as the letter sequence [b,r,o,d,o] (wherein the element "o"
    appears twice at different positions)? [...] 
 
 Content analysis details:   (0.8 points, 5.0 required)
 
  pts rule name              description
 ---- ---------------------- --------------------------------------------------
  0.0 URIBL_BLOCKED          ADMINISTRATOR NOTICE: The query to URIBL was blocked.
                             See
                             http://wiki.apache.org/spamassassin/DnsBlocklists#dnsbl-block
                              for more information.
                             [URIs: googlegroups.com]
  2.7 DNS_FROM_AHBL_RHSBL    RBL: Envelope sender listed in dnsbl.ahbl.org
                             [listed in googlegroups.com.rhsbl.ahbl.org.	IN]
                             [A]
 -0.0 RCVD_IN_MSPIKE_H3      RBL: Good reputation (+3)
                             [209.85.217.188 listed in wl.mailspike.net]
  0.0 T_HEADER_FROM_DIFFERENT_DOMAINS From and EnvelopeFrom 2nd level mail
                             domains are different
 -0.0 SPF_PASS               SPF: sender matches SPF record
  0.0 FREEMAIL_FROM          Sender email is commonly abused enduser mail provider
                             (ilmen.pokebip[at]gmail.com)
  0.0 DKIM_ADSP_CUSTOM_MED   No valid author signature, adsp_override is
                             CUSTOM_MED
  0.0 HTML_MESSAGE           BODY: HTML included in message
 -1.9 BAYES_00               BODY: Bayes spam probability is 0 to 1%
                             [score: 0.0000]
 -0.1 DKIM_VALID             Message has at least one valid DKIM or DK signature
  0.1 DKIM_SIGNED            Message has a DKIM or DK signature, not necessarily valid
  0.0 T_FREEMAIL_FORGED_FROMDOMAIN 2nd level domains in From and
                             EnvelopeFrom freemail headers are different
 -0.0 RCVD_IN_MSPIKE_WL      Mailspike good senders

This is a multi-part message in MIME format.
--------------010607000702050300030904
Content-Type: text/plain; charset=UTF-8; format=flowed

coi ro do

I would like to hear your opinion about the following.

Can the predicate {porsi} be applied to a sequence 
<http://en.wikipedia.org/wiki/Sequence>, in the sense of an ordered list 
allowing multiple occurrences of the same element, such as the letter 
sequence [b,r,o,d,o] (wherein the element "o" appears twice at different 
positions)?

The second and third argument slots of {porsi} seem to entails that it 
is only appropriate to describe ordered sets generated from applying a 
sorting rule to an unordered set, which probably (though I'm not sure, 
it depends on the exact definition of {porsi}) excludes sequences with 
duplicate elements.

If you think that the letter sequence "brodo" can satisfy {porsi}'s x1, 
I'd be grateful if you could show me the Lojban definition of the 
sorting rule that can output the sequence "brodo" when applied to the 
unordered set of letters {b,r,o,d}. :)

Another way to claim in Lojban that [b,r,o,d,o] (for example) is a 
sequence could be {X te lidne da de}; however that wouldn't work with 
unary sequences (which are probably identical to their equivalent 
unordered sets anyway).

Any thought, comment or suggestion will be greatly appreciated.

mi'e la .ilmen. mu'o


-- 
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.

--------------010607000702050300030904
Content-Type: text/html; charset=UTF-8

<html>
  <head>

    <meta http-equiv="content-type" content="text/html; charset=utf-8">
  </head>
  <body text="#000000" bgcolor="#FFFFFF">
    coi ro do<br>
    <br>
    I would like to hear your opinion about the following.<br>
    <br>
    Can the predicate {porsi} be applied to a <a
      href="http://en.wikipedia.org/wiki/Sequence">sequence</a>, in the
    sense of an ordered list allowing multiple occurrences of the same
    element, such as the letter sequence [b,r,o,d,o] (wherein the
    element "o" appears twice at different positions)?<br>
    <br>
    The second and third argument slots of {porsi} seem to entails that
    it is only appropriate to describe ordered sets generated from
    applying a sorting rule to an unordered set, which probably (though
    I'm not sure, it depends on the exact definition of {porsi})
    excludes sequences with duplicate elements.<br>
    <br>
    If you think that the letter sequence "brodo" can satisfy {porsi}'s
    x1, I'd be grateful if you could show me the Lojban definition of
    the sorting rule that can output the sequence "brodo" when applied
    to the unordered set of letters {b,r,o,d}. :)<br>
    <br>
    Another way to claim in Lojban that [b,r,o,d,o] (for example) is a
    sequence could be {X te lidne da de}; however that wouldn't work
    with unary sequences (which are probably identical to their
    equivalent unordered sets anyway).<br>
    <br>
    Any thought, comment or suggestion will be greatly appreciated.<br>
    <br>
    mi'e la .ilmen. mu'o<br>
    <br>
    <br>
  </body>
</html>

<p></p>

-- <br />
You received this message because you are subscribed to the Google Groups &quot;lojban&quot; group.<br />
To unsubscribe from this group and stop receiving emails from it, send an email to <a href="mailto:lojban+unsubscribe@googlegroups.com">lojban+unsubscribe@googlegroups.com</a>.<br />
To post to this group, send email to <a href="mailto:lojban@googlegroups.com">lojban@googlegroups.com</a>.<br />
Visit this group at <a href="http://groups.google.com/group/lojban">http://groups.google.com/group/lojban</a>.<br />
For more options, visit <a href="https://groups.google.com/d/optout">https://groups.google.com/d/optout</a>.<br />

--------------010607000702050300030904--