Hi, i wrote: > > Kurt Goedel. Incompleteness theorem.
deloptes wrote: > If you've been studying logic you would know better, Ahum. Which of the preconditions of the theorem are not fulfilled by the kind of logic you refer to ? - Can some of its true statements not be written down as finite sequences of symbols from a finite or countably infinte alphabet ? - Does it deny any of these fundamental properties of natural numbers: unlimited addition, multiplication as iteration of addition, prime numbers ? - Is it not compliant to classical logic, as used throughout mathematics until about 1930 ? Have a nice day :) Thomas
