555 research outputs found
Fuzzy inequational logic
We present a logic for reasoning about graded inequalities which generalizes
the ordinary inequational logic used in universal algebra. The logic deals with
atomic predicate formulas of the form of inequalities between terms and
formalizes their semantic entailment and provability in graded setting which
allows to draw partially true conclusions from partially true assumptions. We
follow the Pavelka approach and define general degrees of semantic entailment
and provability using complete residuated lattices as structures of truth
degrees. We prove the logic is Pavelka-style complete. Furthermore, we present
a logic for reasoning about graded if-then rules which is obtained as
particular case of the general result
Fuzzy Galois connections on fuzzy sets
In fairly elementary terms this paper presents how the theory of preordered
fuzzy sets, more precisely quantale-valued preorders on quantale-valued fuzzy
sets, is established under the guidance of enriched category theory. Motivated
by several key results from the theory of quantaloid-enriched categories, this
paper develops all needed ingredients purely in order-theoretic languages for
the readership of fuzzy set theorists, with particular attention paid to fuzzy
Galois connections between preordered fuzzy sets.Comment: 30 pages, final versio
- …