| Information | |
|---|---|
| has gloss | eng: In abstract algebra, a Robbins algebra is an algebra containing a single binary operation, usually denoted by \lor, and a single unary operation usually denoted by \neg. These operations satisfy the following axioms: |
| lexicalization | eng: Robbins algebra |
| instance of | e/Formal methods |
| Meaning | |
|---|---|
| Dutch | |
| has gloss | nld: Een Robbins algebra is een algebra bestaande uit de verzameling 0, 1 } en de logische operatoren \or (disjunctie, "of") en \neg (negatie, "niet") en de volgende axioma's. |
| lexicalization | nld: Robbins algebra |
| lexicalization | nld: Robbins-algebra |
Lexvo © 2008-2024 Gerard de Melo. Contact Legal Information / Imprint