Proposition 1: Explaining what's on the ballot

Propositional Logic

An adequate set of connectives for propositional logic is a set such that for every formula of propositional logic there is an equivalent formula with only connectives from that set. For example, the set {, ∨} is adequate for propositional logic, because any occurrence of ∧and →can be removed by using the equivalences ϕ→ψ≡ϕ∨ψand ϕ∧ψ≡(ϕ∨ψ). (a) Show that {, ∧},{, →} and {→, ⊥} are adequate sets of connectives for propositional logic. (In the latter case, we are treating ⊥as a nullary connective.)