vanhees71 said:
I never understood, what intuitionistic math is good for beyond the fact that it might be an intellectually interesting game of thought ;-).
I spent a good number of years studying intuitionistic and constructive mathematics. I think it's interesting, but I'm not convinced that anything worthwhile comes from it.
An interesting fact about intuitionistic mathematics is the isomorphism between intuitionistic proofs and computer programs. Intuitionistically, if you prove a statement of the form
##\forall x \exists y: \phi(x,y)##
you can extract a program (expressed as a lambda-calculus expression) that given any ##x## returns a ##y## satisfying ##\phi(x,y)##.
Every proposition in constructive logic (I'm a little hazy about the exact distinction between constructive and intuitionistic) corresponds to a type, in the computer-science sense, and the proofs of those propositions correspond to mathematical objects of that type. So for example:
##A \wedge B## corresponds to the set of ordered pairs ##(a,b)## where ##a## is a proof of ##A## and ##b## is a proof of ##b##.
##A \rightarrow B## corresponds to the set of functions which given a proof of ##A## returns a proof of ##B##.
##A \vee B## corresponds to the disjoint union of proofs of ##A## and proofs of ##B##.
etc. (quantifiers correspond to product types and tagged unions).
I think it's all very interesting, and it gives some insight into logic and programming and the connection between them. But ultimately, I don't see the whole endeavor as being tremendously useful.