On Fri, Oct 04, 2013 at 04:51:02PM +0200, Bruno Marchal wrote: > > Read AUDA, where you can find the mathematical definition for each > pronouns, based on Kleene's recursion theorem (using the Dx = "xx" > trick, which I promised to do in term of numbers, phi_i, W_i, etc. > but 99,999% will find the use of them in UDA enough clear for the > reasoning. Yet, I have made AUDA as I was told some scientists were > allergic to thought experiments, and indeed studied only AUDA (and > got no problem with it). >
Hi Bruno, You meade this comment before, and I just passed over it, because it didn't seem that relevant to the thread. I am familiar with your AUDA from your Lille thesis, of course, but don't recall anywhere where you discuss formalisation of pronouns. Perhaps you do this in another treatment of the AUDA I haven't read? Or perhaps you have some slightly different idea in you mind that I'm missing? Just wondering... Cheers -- ---------------------------------------------------------------------------- Prof Russell Standish Phone 0425 253119 (mobile) Principal, High Performance Coders Visiting Professor of Mathematics [email protected] University of New South Wales http://www.hpcoders.com.au ---------------------------------------------------------------------------- -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/groups/opt_out.
