Systems of ordinal fuzzy logic with application to preference modelling
In this paper, we survey several many-valued propositional logics in which the truth-functions (in the real unit interval [0,1]) of their connectives are definable only from the natural ordering of the scale, without using any richer algebraic structure. In particular we describe a complete notion of proof for weighted formulas of the implication-free fragment of Godel logic with involution. The usefulness of this logical framework for the formalization of ordinal preference modelling is also shown. (C) 2001 Elsevier Science B.V. All rights reserved.
fuzzy logic ordinal connectives fuzzy preference structure nilpotent minimum