ABSTRACT
In this section, it is assumed that the reader is familiar with basic logic and can verify truth of statements by truth tables. For example, p ∧ q → p is a fairly simple true statement. Many more exercises could be given in the section, many duplicating those given for boolean algebras, sets with unions and intersections, or even associative laws for many binary relations like integer addition. The rightarrow → is implication, whereas ⇒ is logical implication. The symbols ∧ and ∨ are short for “AND” and “OR” respectively, and ¬p is the negation of p. Only a few solutions are given to the following exercises as most are rather routine.
