Problem 8.1

[system]

Disclaimer: Dieser Thread wurde aus dem alten Forum importiert. Daher werden eventuell nicht alle Formatierungen richtig angezeigt. Der ursprüngliche Thread beginnt im zweiten Post dieses Threads.

[lmr]

Problem 8.1
Refresher 8.1:
Show that all logical binary connectives (¬,∧,∨,⇒,⇔) can be expressed by the ↓ (nor) connective…

The ¬ (not) operator is unary right?
The way the problem is put suggests that not is a binary connective.
Should we show that not can be expressed by nor?

[Jazzpirate]

---

The ¬ (not) operator is unary right?

Yes

The way the problem is put suggests that not is a binary connective.

no, it does not arrgh, now I understand. Damn, yes, it does suggest that, but also yes, it is unary.

Should we show that not can be expressed by nor?

You can try to show that, but you’ll fail, because it can damn negations

Point being: „not“ can be expressed purely in terms of „nor“, as the exercise suggests, but as you accurately said, it is unary, not binary