|
coi ro do I would like to hear your opinion about the following. Can the predicate {porsi} be applied to a 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. |