Re: what is a loglang?

And Rosta scripsit:

> I'd be very interested in a formalism that could do without variables
> yet could unambiguously represent conceptually discrete propositions.
See www.cuni.cz/~peregrin/PDFTxt/variabl.pdf for a relatively (I emphasize
relatively) straightforward exposition of this.  The general idea is that
if we reduce all predicates to having only a single argument, we can allow
ourselves to use only one variable with clever quantification, and then
we don't need to write the variable.  (This is handwaving, but I can't do
any better just at present.)

Reducing multi-argument predicates is done by currying (named after Haskell
Curry, nothing to do with curry):  we rewrite "father(X,Y)" as "(father'(X))(Y)".

--
John Cowan                              <jcowan@...>
http://www.ccil.org/~cowan              http://www.reutershealth.com
                Charles li reis, nostre emperesdre magnes,
                Set anz totz pleinz ad ested in Espagnes.

Reply