how do I prove that {[math]\bot, \implies[/math]} is functionally complete?
>>9150081
Prove that you can derive the typical three connectives, (and, or, not) or find a normal form such as https://en.wikipedia.org/wiki/Disjunctive_normal_form
to help you build truth tables
>>9150090
It is enough to just prove [math]\land[/math] and [math]\neg[/math].
[math]p \lor q = \neg ( \neg p \land \neg q )[/math]
>>9150090
do I use two variables or just one?
Because I got [math](a\implies\bot)\iff\neg a[/math]
Then [math](a\implies a) \iff (a \vee \neg a)[/math]