Logic for Programmers: A Gentle Introduction to Sequent Calculus
2025-01-22
This post, the first in a series on logic, introduces sequent calculus as a powerful system for reasoning. Using Gentzen's notation, the author explains how to represent logical inferences symbolically, covering inference rules, derivation trees, and metavariables. The article compares sequent calculus, sequent natural deduction, and natural deduction, and touches upon one-sided sequent calculus and intuitionistic logic. Finally, it briefly introduces proof terms in intuitionistic logic and their connection to simply-typed lambda calculus.