Assume A is a wff (well formed formula). Give a proof by induction that in order to assign a truth value to A it suffices to assign truth values to variables occurring in A.
Provide a definition by recursion of a function F such that for every wff (well formed formula) A, F(A) is a wff (well formed formula) obtained from A by replacing all occurrences of p with q and all occurrences of q with p simultaneously. (For example, F((p implies q)) = (q implies p).)