How to Write a Proof
From MaRDI portal
Recommendations
Cited in
(28)- Structured calculational proof
- Processes are in the eye of the beholder
- EWD1300: The notational conventions I adopted, and why
- Presenting inequations in mathematical proofs
- From Boolean algebra to unified algebra
- Lower bounds for asynchronous consensus
- The surveyability of long proofs
- Invariants for the FoCaL language
- Student proof exercises using MathsTiles and Isabelle/HOL in an intelligent book
- Splitting forward simulations to cope with liveness
- Improving legibility of natural deduction proofs is not trivial
- A Declarative Language for the Coq Proof Assistant
- Structuring Mathematical Proofs
- scientific article; zbMATH DE number 8327 (Why is no real title available?)
- DiskPaxos
- scientific article; zbMATH DE number 1331926 (Why is no real title available?)
- Formalizing a hierarchical file system
- On union ultrafilters
- NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF
- Plans and planning in mathematical proofs
- Programming and verifying a declarative first-order prover in Isabelle/HOL
- The challenge of computer mathematics
- Structured derivations: a unified proof style for teaching mathematics
- Finding tactics in proofs
- How to write a 21\(^{\text{st}}\) century proof
- Composition: a way to make proofs harder
- Certified first-order AC-unification and applications.
- Improving automation for higher-order proof steps
This page was built for publication: How to Write a Proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870018)
