Back to Basics (1) Forming Propositions

A proposition is a formula possessing a truth value indicated by ○ (true) and ● (false). In Boolean Algebraic Logic each proposition is either ○ or ● and no where in between. The following tables indicate how each connective alters the truth values of its components. Each truth value of a compound formula is a function of the truth values of its components.

¬ is called negation, ∧ is called a conjunction, ∨ disjunction, ⇒ implication, and ⇔ equivalence.