Another proof of the completeness of the Łukasiewicz axioms and of the extensions of Di Nola's theorem. (Q2351509): Difference between revisions

Using Farkas' lemma the authors embed every finite partial subalgebra of an MV-chain into the standard rational MV-algebra. This easily yields a new proof of Chang's completeness theorem for Łukasiewicz logic. This method was also used, for a more general completeness theorem, in the paper by \textit{R. Cignoli} and \textit{D. Mundici} [Mult.-Valued Log. 6, No. 1-2, 89-94 (2001; Zbl 1020.03019)]. Combining these techniques with the main result of the paper by \textit{M. Botur} [Fuzzy Sets Syst. 178, No. 1, 24-37 (2011; Zbl 1252.03145)], the authors then provide a new proof of Di Nola's representation theorem, without using model-theoretic techniques. Similar results for zero-cancellative partially ordered monoids were obtained in the paper by \textit{J. Paseka} [Math. Slovaca 64, No. 3, 777-788 (2014; Zbl 1337.06008)].