Mathematical Logic and Foundations — Graph

What theoretical foundations did Turing's 1936 paper lay for computation, years before the machines it described could be built?

What did Paul Cohen prove about the continuum hypothesis, and what does it mean for a mathematical statement to be 'independent' of an axiom system?

What areas of mathematics did Sierpiński contribute to across his prolific career?

What did the Logic Theorist program accomplish when it tackled Principia Mathematica's theorems?

What architectural idea did Milner's LCF proof-assistant establish that later proof assistants still follow?

What is temporal logic, and why did Amir Pnueli think it was suited to describing computer programs?
How does temporal logic let you express properties like 'the system will eventually respond' with mathematical precision?

How did Vladimir Voevodsky's homotopy theory for algebraic varieties let him prove Milnor's conjecture?

What is the Curry-Howard correspondence, and what does it say about the relationship between logical proofs and computer programs?
Why is the Curry-Howard correspondence described as an isomorphism rather than just an analogy?
How do modern proof assistants like Coq and Lean rely on the Curry-Howard correspondence to verify mathematical proofs?
Why did Howard's 1969 note take over a decade to reach publication, and how did it influence programming language theory?