1,913 followers
@EscardoMartin One non-computability instance of constructive logic I found enlightening arises when ascribing a logic to a program analysis. If the analysis is an overapproximation, then LEM does not hold for the meaning of the logical statements. First