“Fuzzification” of binary and finite multivalued logical calculi
✍ Scribed by V. Pinkava
- Publisher
- Elsevier Science
- Year
- 1976
- Weight
- 692 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0020-7373
No coin nor oath required. For personal study only.
✦ Synopsis
It is shown that fuzzification of binary logics results in multivalued logics with aninfinite or finite number of values. Canonic formulae in fuzzified binary logics are discussed using some previous results of the author. The case of "hybrid" logics where either the variables or the functions run through different sets of values is discussed briefly. It is shown that the generalized connectives suggested by the author are suitable for forming functionally complete systems in these hybrid logics. Further fuzzification of finite multivalued calculi is discussed briefly. It is shown that a "fuzzified" multiple-valued logical function turns into an n-tuple of functions. A few simple illustrative examples are given.
📜 SIMILAR VOLUMES
## PROPERTIES OF MEMBERSHIP FUNCTIONS, FUZZIFICATION, AND DEFUZZIFICATION "Let's consider your age, to begin with -how old are you?" "I'm seven and a half, exactly." "You needn't say 'exactually,' " the Queen remarked; "I can believe it without that. Now I'll give you something to believe. I'm jus
For instance, the consequence gy(,,, \*,O of the empty L-fuzzy set Op = 0, 'p E P ( P , L,A) is an L-fuzzy subset of F ( P , L, A ) , which assigns to every 'p E F ( P , L, A ) its tautological degree (%9(P,&)O) 'p E L.
This paper has the limited aim of presenting. an elementary treatment of the notion of defining the values of a number-theoretic function q from a finite number of substitution instances of a system r of equations, or as we shall say, of the finite definubility of 9 by r. We construct an equational