On Tue, Jan 27, 2015 at 6:47 PM, Ilmen
<ilmen....@gmail.com> wrote:
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}. :)
In my view, ro da poi porsi cu gunma lo te porsi be da, so porsi3 are all the members of porsi1, not just the member types. So for example the sequence of digits in the decimal expansion of pi has an infinite number of elements, not just ten.
Describing the porsi2 of [b,r,o,d,o] is a pain because it's an arbitrary sequence, not one that follows some simple rule. Since we're going to need to refer to two instances of the letter "o" we can use the pronouns ".o bu xi pa" and ".o bu xi re" for each instance, and "by", "ry" and "dy" for the other three letter instances. Then porsi2 could be something like "lo du'u ge by cu pa moi gi ge ry cu re moi gi ge .o bu xi pa cu ci moi gi ge dy cu vo moi gi ,o bu xi re cu mu moi".
mu'o mi'e xorxes