16 ms·
> Only in classical logic you can deduce from this that the set of prime numbers must be infinite. In intuitionistic logic you can't deduce this. ? I was not a
by paulddraper 10y ago
> Only in classical logic you can deduce from this that the set of prime numbers must be infinite. In intuitionistic logic you can't deduce this.
? I was not aware of any system where proof by contradiction isn't acceptable.
The opposite of false is true.
But apparently you are right. https://en.wikipedia.org/wiki/Intuitionistic_logic https://en.wikipedia.org/wiki/Intuitionistic_logic
> intuitionistic logic has no interpretation as a two-valued logic
- deleted 10y ago[deleted]
- 4ad 10y agoOne thing to note is that theorem provers/proof assistants like Coq and Agda are based on constructive mathematical foundations (calculus of constructions). Type theory (related to types in programming languages, lambda calculus is one potential example) is also fundamentally constructive.