It's a truth table: the operations described (or, and, ==) can all be considered as applying just to True and False. In that case, to describe the operator completely you merely need to list all the possible inputs.
So, for instance, the operator or is defined as :
(True or True) is True
(True or False) is True
(False or True) is True
(False or False) is False
That completely explains what or does to boolean values.
If you're interested, that wiki page actually lists all the possible boolean binary operators:
0. Opq, false, Contradiction
1. Xpq, NOR, Logical NOR
2. Mpq, Converse nonimplication
3. Fpq, ¬p, Negation
4. Lpq, Material nonimplication
5. Gpq, ¬q, Negation
6. Jpq, XOR, Exclusive disjunction
7. Dpq, NAND, Logical NAND
8. Kpq, AND, Logical conjunction
9. Epq, XNOR, If and only if, Logical biconditional
10. Hpq, q, Projection function
11. Cpq, if/then, Logical implication
12. Ipq, p, Projection function
13. Bpq, then/if, Converse implication
14. Apq, OR, Logical disjunction
15. Vpq, true, Tautology