Thursday, January 12, 2012
Surfing For In More Than Satisfactory?
Sharon asks…in any self-consistent set of axioms, there exist theorems which can neither be proved or disproved..Godel?A few thoughts Many years ago as a maths/physics undergrad I was discussing this in the pub with other students. At the time we argued whether certain mathematical propositions belonged to the class of 'undecidables', eg Fermat's Last Theorem, Goldenbach's Conjecture etc My argument was that if these were undecidable it would be inconsistent with them being false, therefore
