On Friday, June 05, 2009 4:37 PM, Ronnie Brown wrote in categories@mta.ca: RB>> Mind you there was a serious point: how to turn abstract mathematics into machine computation? <<RB Ronnie ====== I shall be presenting the following two papers analysing this problem - and proposing a solution in the case of the Peano Arithmetic, PA - on June 14th at the 2009 International Conference on Theoretical and Mathematical Foundations of Computer Science, Orlando, USA. TMFCS 173: The significance of Aristotle's particularisation in the foundations of mathematics, logic and computability II - Goedel and formally undecidable arithmetical propositions http://alixcomsi.com/25_Aristotlean_particularisation_II_Goedel_Update.p df TMFCS 174: The significance of Aristotle's particularisation in the foundations of mathematics, logic and computability IV - Turing and a sound, finitary, interpretation of PA http://alixcomsi.com/25_Aristotlean_particularisation_IV_Turing_Update.p df Regards, Bhup [For admin and other information see: http://www.mta.ca/~cat-dist/ ]