I am stuck on one part of this question.
Suppose we have the single binary connective →, plus the symbol for absurdity ⊥. Using just these expressions, see if you can ﬁnd a way to express ¬P, P∧Q, and P∨Q.
I know that for ¬P the answer is P→⊥
I know that for P∨Q the answer is (P→⊥)→Q
I am stuck on P∧Q..
And help would be great. Thanks!