Re: [lojban] &Lang

[Jorge Llambías <jjllambias@gmail.com>]

On Tue, Aug 14, 2012 at 10:55 PM, And Rosta <and.rosta@gmail.com> wrote:
>
> [...] that's
> the direction where I think the solution lies: iteratively uniting two
> predicates into one, with a method for indicating which argument-places
> merge into a single argument-place, ideally without having
> lexicosyntactically *explicit* variables filling argument-places.
>
> E.g. F(a,b) and G(c,d) merge into a compound predicate H(a,b=c,d).
>
> (My own unpublished solutiontakes this approach, with an inflectional
> machinery for encoding how two argument lists (e.g. <a, b> & <c, d>) merge
> into one  (e.g. <a, b=c, d>).)

I guess that means you need Bell number B(n) of inflections per
connective for predicates that together have n arguments. This number
grows pretty fast with n, http://en.wikipedia.org/wiki/Bell_numbers
but I guess you must have some way of compositionally creating the
inflections so they are manageable,

mu'o mi'e xorxes

-- 
You received this message because you are subscribed to the Google Groups "lojban" group.
To post to this group, send email to lojban@googlegroups.com.
To unsubscribe from this group, send email to lojban+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/lojban?hl=en.