There have been 1 completed talk and 1 topic suggestion tagged with constructive mathematics.
Delivered by Fengyang Wang on Wednesday November 1, 2017
Constructive mathematics, as the name would suggest, is centered on the philosophy that mathematical proofs should be able to be turned into algorithms. We will contextualize constructive approaches to analysis, roughly following Bridges and Vîţă. This talk has no formal prerequisites beyond an elementary understanding of the real numbers and the usual concept of completeness. In particular, no logical background is assumed; intuitionistic logic will be overviewed in the talk. We will finish with a discussion of the ramifications of completeness of the real numbers.
A summary of this talk is available here.
Constructive mathematics, or mathematics without the law of the excluded middle, is becoming more popular thanks to connections with computer science, category theory, and topology. Its logical foundations may be initially difficult to grasp for those used to a classical system.
Possible reference materials for this topic include
Quick links: Google search, arXiv.org search, propose to present a talk
computability computer science constructive mathematics logic philosophy topology type theory