Logic is the glue that binds together methods of reasoning, in all domains.
---David Gries and Fred B. Schneider

Calculational logic is a propositional and predicate logic that is designed to be used --as opposed to logician's logics, which are designed to make the study of logic more effective. Proofs in the logic resemble proofs found in many fields of mathematics, such as linear algebra, modern algebra, and even calculus. At the core, a calculational-logic proof is simply a sequence of subsitutions of equals for equals.

Click on any of the following items for more information.

• A text on teaching logic as a tool: A Logical Approach to Discrete Math
• Errors corrected in third printing (pdf file)
• Instructor's Manual for A Logical Approach to Discrete Math

 
• Brief introduction to calculational logic
• Inference rules of calculational logic
• Axioms of calculational logic
• Precedence rules
• Useful proof principles and heuristics
• Grounding informal proof techniques in logic
• A neat solution to a word problem

 
• A short history of calculational logic

 
• Articles and lectures on teaching logic as a tool
• A Glimmer(ick) of Hope (Banquet speech at ZUM95, September 1995, in Limerick, Ireland, so be prepared.)

 
• Trefethen's madness --thoughts on Gries in limerick form

 
• Home pages for: Gries and Schneider