I understand how a set of connectives such as {∨,∧,¬}, can be considered adequate, but I'm not fully understanding how one would go proving something that is not adequate
The full problem is as follows:
Use structural induction to prove that any formula φ defined using only the connectives ∨ and ∧ has the following property: Let α be an assignment of truth values to the variables in φ, and let ˆα be an assignment that results by switching the value of α at one variable from false to true. (That is, there is a variable p such that α(p) = false and ˆα(p) = true, but α(q) = ˆα(q) for all other variables q.) If φ = true then φ = true. The desired result follows because not every formula has this property
I drew up a truth table for this but I'm stuck from there.
Thank you,