[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [lojban] A recursively-defined predicate for building chains (was: Lojban for great-great-grandfather)




On Aug 16, 2014 12:30 PM, "Jorge Llambías" <jjllambias@gmail.com> wrote:
>
>
>
>
> On Sat, Aug 16, 2014 at 12:32 PM, Jacob Errington <nictytan@gmail.com> wrote:
>>
>>
>> We propose a predicate to construct such chains, of arbitrary length, defined as follows in Lojban:
>>
>> .i lo ka broda cu ka ko'a ko'e fo'a fo'e ce'ai lo du'u fo'a li pa dubmau kei goi dy zo'u ge ganai me'au dy gi ko'a me'au fo'e lo broda be ko'e bei li mo'e fo'a vu'u pa bei fo'e gi ga me'au dy gi ko'a ko'e me'au fo'e
>
>
> How about using the lujvo "tenki'i", defined:as: ko'a ckini ko'e lo tenfa be ko'i bei ko'o
>

I can't say that I like using tenfa like this. It seems to me like a happy coincidence that we use exponentiation notation for both repeated multiplication and repeated function application in general. I also don't like allowing both numbers and predicates in the tenfa, if we were to try generalizing it without adding a place for the predicate (in which case we pretty much wind up with my predicate, but with the possibility of non-natural exponents, which doesn't make a lot of sense outside of exponentiation.)

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