Exhaustively, there are 16 possible truth tables for two propositions. If we interpret the values in the rows as binary digits, we can conveniently use the resulting hexadecimal digit as the respective name for each truth table, as follows:
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | A | B | C | D | E | F | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| $p$ | $q$ | $\mathbb F$ | $\land$ | ? | $p$ | ? | $q$ | $\veebar$ | $\lor$ | $\downarrow$ | $\leftrightarrow$ | $\lnot q$ | $\leftarrow$ | $\lnot p$ | $\rightarrow$ | $\uparrow$ | $\mathbb T$ |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 |
Tables 0, 3, 5, A, C and F are not particularly interesting as the output is independent of at least one of the operands.
For the remaining tables, I'm aware of at least one commonly used symbol associated with the operation (examples shown above), but not for tables 2 and 4, which are the negation of sufficient, i.e. $\lnot(p\rightarrow q)$, and the negation of necessary, i.e. $\lnot(p\leftarrow q)$, respectively.
Are there symbols commonly used for these two operations?
There is the symbol $\setminus$ (
\setminusin latex), used in set theory to denote set difference. The first question mark (2) could thus be $p\setminus q$. Note that it satisfies a property dual to the defining property of the implication $p ≤ q→r ⇔ p∧q≤r$, namely $p\setminus q ≤ r ⇔ p ≤ q∨r$. It could be called a "coimplication", cf. for instance here. See also here where it is called a subtraction (in the examples, they mention that $x\setminus y = x∧¬y$ in a Boolean algebra for instance).I didn't know the symbol $\veebar$ for XOR, I only knew $⊕$.