Order, lattices, ordered algebraic structures Definition
MV-algebra
Builds on MonoidBoolean algebra
Definition
An MV-algebra is a structure , where is a binary operation, is a unary operation and , such that for all :
- is a commutative monoid.
- .
- .
- .
Remarks
Example: the unit interval with , and is an MV-algebra. Clauses 1 to 3 are direct, since . For clause 4, if the left side is , and if it is ; so both sides equal .
Non-example: the integers satisfy clauses 1 and 2, but fail clause 3, since .
Every Boolean algebra is an MV-algebra with and the complement. The constant is written , and is the dual operation.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Boolean algebra concept
- Monoid concept
- MV-algebra definition
Further reading
About this page
| Tag | QVWHWDJ5X1 |
|---|---|
| URI | m2://QVWHWDJ5X1 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06D35, 03G20, 03B50 |
| Defines | MV-algebra |
| Uses | Monoid, Boolean algebra |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.