On calculational proofs
From MaRDI portal
Recommendations
Cites work
- Dijkstra-Scholten predicate calculus: Concepts and misconceptions
- Equational propositional logic
- scientific article; zbMATH DE number 3740740 (Why is no real title available?)
- scientific article; zbMATH DE number 1555175 (Why is no real title available?)
- scientific article; zbMATH DE number 194642 (Why is no real title available?)
- scientific article; zbMATH DE number 789390 (Why is no real title available?)
- scientific article; zbMATH DE number 3304881 (Why is no real title available?)
Cited in
(17)- On the number of steps in proofs
- Structured calculational proof
- Dijkstra-Scholten predicate calculus: Concepts and misconceptions
- Formality works
- On the desirability of mechanizing calculational proofs
- CalcCheck: a proof checker for teaching the ``Logical approach to discrete math
- The calculus of natural calculation
- Designing a Calculational Proof of Cantor's Theorem
- The Formal System of Dijkstra and Scholten
- The teaching tool CalcCheck: a proof-checker for Gries and Schneider's ``Logical approach to discrete math
- scientific article; zbMATH DE number 4070869 (Why is no real title available?)
- scientific article; zbMATH DE number 1088212 (Why is no real title available?)
- scientific article; zbMATH DE number 1863378 (Why is no real title available?)
- How to calculate proofs: bridging the cultural divide
- Structured derivations: a unified proof style for teaching mathematics
- An elementary and unified approach to program correctness
- Heuristics for a calculational proof
This page was built for publication: On calculational proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957914)