I am working on an inference system for infinite valued Łukasiewicz logic, using standard MV-algebras.
As a pre-processing step, I would like to perform (non-exhaustive) simplification of formulae. So I am wondering what simplifying equivalences hold in the algebra of this logic. I know that the usual lattice axioms hold:
$$a \lor a = a$$ $$a \land a = a$$ $$ \vdots$$ $$ \text{etc.}$$
The absorption laws listed above would are good examples of simplifying formulae.
Anybody know of some other good simplifying algebraic identities for Łukasiewicz logic?
For a convenient set of identities, have you checked the usual axioms of MV-algebras? For normal forms, have you had a look at McNaughton's theorem? The answer to these questions may be found in the work by Antonio Di Nola and by Daniele Mundici. Have you checked the proof-theoretic approach proposed by George Metcalfe?