# Class 06: SOP: Boolean Reasoning

Held: Friday, February 4, 2005

Summary: Today we begin to consider mechanisms for Boolean proof.

Related Pages:

Due

Assignments

Notes:

• The Revised5 Report on the Algorithmic Language Scheme will be available outside my office this afternoon.

Overview:

• How to prove
• Basic laws
• Other issues

## Proof and Reasoning

• As you may have noted from our initial consideration of what we might do in Boolean logic, proof is a key activity in working with Boolean values.
• How do you prove that a proposition is a tautology?
• Build a truth table. Building a truth table is time consuming (how much so?) but is guaranteed to give us a correct answer and can be automated.
• Prove that the proposition is equivalent to a simpler proposition, and prove that the simpler proposition is a tautology.
• How do we prove that two propositions are equivalent?

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Wed Mar 2 11:39:12 2005.
The source to the document was last modified on Tue Jan 25 12:37:37 2005.
This document may be found at `http://www.cs.grinnell.edu/~rebelsky/Courses/CS302/2005S/Outlines/outline.06.html`.

You may wish to validate this document's HTML ; ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu