Cutlike semantics for fuzzy logic and its applications (Q4460980)

The author extends the idea that a fuzzy set may be represented by its family of \(\alpha\)-cuts to the semantics of the first-order monoidal logic, as introduced by \textit{U. Höhle} [J. Math. Anal. Appl. 201, 786--826 (1996; Zbl 0860.03038)], which has an algebraic semantics determined by the class of all integral commutative lattice-ordered monoids over a complete lattice \({L}\). The core idea is that the author splits each \({L}\)-structure \({M}\) into a ``nested'' family -- indexed by the members of \({L}\) -- of classical, i.e. two-valued structures, and also each \({M}\)-valuation into a family of valuations w.r.t. the family members. The crucial result is that he is able to reconstruct \({L}\)-structures and \({M}\)-valuations from such ``nested'' families of two-valued structures and corresponding families of evaluations. These general results are then used to discuss the possibility of a similar reduction of fuzzy structures to suitable families of corresponding classical structures. And this is done for particular fuzzy relations, for fuzzy Galois connections, and for fuzzy automata. However, sometimes the author has to restrict his considerations to linearly ordered monoids only. Reviewer's remark: The author works in a standard elementary setting. The impression is that a sheaf-theoretic context could be more appropriate.