How to Write a Proof

DOI10.2307/2974556zbMath0877.00005OpenAlexW4232500117MaRDI QIDQ4870018

Leslie Lamport

Publication date: 10 December 1997

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2974556

zbMATH Keywords

natural deductionmathematical proofshierarchical structuring

Mathematics Subject Classification ID

General and miscellaneous specific topics (00A99)

Related Items

Improving automation for higher-order proof steps, From Boolean algebra to unified algebra, Invariants for the FoCaL language, The challenge of computer mathematics, Structured derivations: a unified proof style for teaching mathematics, Processes are in the eye of the beholder, A Declarative Language for the Coq Proof Assistant, Formalizing a hierarchical file system, On union ultrafilters, Lower bounds for asynchronous consensus, Programming and verifying a declarative first-order prover in Isabelle/HOL, Student proof exercises using MathsTiles and Isabelle/HOL in an intelligent book, Splitting forward simulations to cope with liveness, The surveyability of long proofs, Structured calculational proof, NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF, PLANS AND PLANNING IN MATHEMATICAL PROOFS