logic funct

are

the resulting 16 logic variables are denoted by w\, w-i,...,

two variables are usually called logic operations.

8
(n

FUZZY

8.1
We
Therefore,
classical
logic.
Logic
Classical
proposition
proposition
One
that
propositional
either
particular
One
variables
the
Assume
be
combination
function.
possible
variables
and
or
The
variables
n,

with the aid of a small number of simple logic functions. These simple funct

to be performed must be specified in some way. There are various ways

can be specified. The most common is the usual u

expressio

this definition with other operations or by including some additional operations. We ma

Sec.
TABLE
1
1

1
0

0
1

0
0

Adopted
of

0
0
0
0
0
0
0

0
0
0
0
1
1
1

0
0
1
1
0
0
1

0
1
0
1
0
1
0

0
1
1
1
1

1
0
0
0
0

1
0
0
1
1

1
0
1
0
1

Zero
Nor
Inhibition
Negation
Inhibition
Negation
Exclusivc-or
function
Nand
Conjunction
Biconditional
Assertion
Implication

1
1

1
I

0
0

0
1

Assertion
Implication

1
1

1
1

1
1

0
1

Disjunction
One

1
w

W2
W3

w
wt
Wl
WS
Wy
^10

wn
Wi2

w
UJ 1 4

preferably
known
set
can
Two
logic:
combining,
in
logic
1.
2.
3.
Every
primary
are
order
algebraic
Other
in
replace,
a

Adopted
symbol
0
V]

Ul
V2
lt=>
yj

tfj
Vi
Vi
Ui
Vl

Vi
V

"I
Vi
1

Other
in
Falsum
Pierce
Proper
Complement
Proper
Complement
Nonequivalence
Sheffer
And
Equivalence
Identity
Conditional,
inequality
Identity
Conditional,
inequality
Or
Verum

Other
in

v
1

for example, a A b and

Vi

-v,,~v,,u
1
!)I|D2,
V1&U2,
U[

"I

Vl
V

V!
Vl

TJ

=> b to the definition.

present this larger set of properties in order to emphasize the relationship

set the

are distributive (B5), bounded (B6), and complemented (B7)-(B

algebra can al

as follows: a <b if a -b =
214

While
logic
we
For
pJl

as
values
When
values
always
equivalent,
are
form,
Various
referred
rules
(a
(b
((a
Modus
premises),
Every
arbitrary
referred
It
is
these
finite
free)
A

3
where
B,
Not
we
algebras,
Properties
that
Boolean
defined
The
guarantee

in which propositions are composed from other propositions by logic ope

propositions are treated as unanalyzed wholes. This is not ade

deductive reasoning for which the internal structure of propositions cannot be ignored.

Sec.
TABLE
(Bl)

Idempotence

(B2)

Commutativity

(B3)

Associativity

a
a
a
a-b

b)

{a
{a

(B4)

Absorption

(B5)

Distributivity

(B6)

Universal

(B7)

Complementarity

(B8)
(B9)

Involution
Dualization

a
a

a
a

c)
a (-0
a -1

a
a
1
H
a
a-b

TABLE
ISOMORPHISMS
BOOLEAN
Set

Boolean

nx)
U

Propositional

V
A

1
0

1
0

n
X
0

c
other
substitutional
defined
a
The
denoted
isomorphisms
Propositional
way
latter
of
Propositions
proposition

represents the sentence "For every individua

(or the equivalent sentence, "All x e X are P"). The symbol V is called a un

216
a
x
where
For
stands
characterizes
speak
Instead
P"
predicate
a
predicate
X
It
it
which
designated
X\
is
X\
elements
ary
Another
with
predominantly
universal
Existential

which
variable
3
(lx)P{x)
xeX

Universal

which
P"
quantifier.
(yx)P(x)

classical two-

three-valued logics, each with its o

in these logics to den

1 = 0, 0 = 1, and 1/2 = 1/2. Other primitives, such as A, v, =>, and ->, differ from
Sec.

For
variable.

stands
such
*i
The
generalized
relation

three-valued logic to another. Five of the best-known three-valued logics, label

where
Formally,
a
P
For
quantifier;
the
formulas
propositional
predicate
8.2
The
proposition
Interpretation,
contingent.
false,
It
restricted
for
are
to
valued
The
Several
common
respectively.
is,
one
names

of their originators, are defined in terms of these

the primitives by

Fuzzy
TABLE

Lukas icvv iC2

A

Bochvar
A V

0
0
0

0 0

0
0
0

1 1
1 4
1 0

j
0

l
I
0

4 0
4 J
4 1
l
1
l

0
1
1

1 1

1 0

J
0

i 4

0
0
0
0

J
4 \ 4 4
4 J i 4
4 ! 4 4

Kle ene
A V

0
:
1

1
1
1

4
0

4 i 4
4 1 i 4
4 I 1 4

I 0 0
> 1 i
1 l i

Heytin
A V
o

Re chenbach

0
0
0
0

0
0
0
0

1 0 0
l 4 4
l 1 1

J
4

0 1 0 0

J 4

1
1

1
1
1 I
J 0
i 1
1 1
1 0
1 4
1 1

1
0
0
0
I

J
0
\
1

A V =>

i
1

1 1
1 i
1 0

4 4
4 , 1 1
4 1 1 J
4
l

We
logics
a,
value
contradiction
of
.
whenever
to
say
(falsity)
Similarly,
contradiction.
Once
desirable
values
n,
unit
1

r,

-l

n-1

These
The
the
defines
a
a
a
a

(8.3)

standa

same sense that the standard fuzzy set theory is only one of a variety of fuzzy

differ from one another by the set operations

logic, we can derive the isomorphic fuzz

Sec.

Lukasiewicz,
logic
a
a
a
It
two-valued
as
For
by
The
Leo.
infinite-valued
numbers
When
truth
logic.
their
other
these
they
formulas
differences
Unless
indicate
[0,
1
cardinality
We
based
to
A
is
is
etc.),
by
logic
corresponding
The
the
which
valued
The
variety

insuffic

of these logics) is connected with the

"V.

illus

8.1a represent, in a given context, the predicate hi

220

is
logic.
obtain
some
alternative
8.3
The
range
false,
and
proposition
In
following
1.
2.
3.
4.
For
Unconditional
The
p:
where
V
particular
membership
T(j>)
for
effect
variable
To
particular
Fig.
measurement
proposition,
p

explained in Sec. 7.4, any pro

distribution f

Sec.
T(p),

each value v
'0
v~*~
(a)
Figure

The
definition
Fig.
We
and
degrees
trivial
In
a
V

as well.

p
where
Consider,
or
by
fuzzy
p
The
the

T(p)
As
possibility

for
(8.6)

V.

(8.6)

Fuzzy

222

Unconditional
Propositions
(8.7)

p
or

(8.8)

p
where
fuzzy
If
say
qualified.
An
true,"
respective
to
proposition
as
proposition
very
respective
In
each

(8.9)

T(p)

(b)
Figure

Sec.

223

Viewing
can
"V
Observe
in
8.2b,
S(F(v))
simplicity.
Let
of
given
Pro{VisF}

(8.10)

and,
formula

T(p)
ueV

As
the
p
may
and
humidity,
be
expressed
Assume
statistical
Unlikely

(a)
Figure

11.2 and 11.3. Here, let us only illustrate the connec

particular fuzzy implication, the Lukasiewicz implication

224
t
/(()
Then,

A = .l
Pro
+

and,
find
in
place,
our
the
degree
make
Observe
given
crisp
79

.
(=70

and

Conditional
Propositions
p
where
on
(X,
where
formula

R(x,y)
where
Fuzzy
Sees.
one

3(a,fc)
Let

(8.14)

/x
,

Q is the same quantifier as in (8.17), and is

by the composition

Sec.

This
and

Conditional
Propositions
p
or
p
where
Since
with
all; / . Thus, for example, the proposition

8.4
Similar
applicability,
In
of
terms
of
about
There
One
p
where
a
general,
An
class
V
by
the
Any
a
p'
where
defined
E(i)
for

we use (8.21) to

226
p
can
p
Here,
Proposition
p
the
form
p':Wisg,
where
of

and,
Tip)
As
distribution
r
This
r
As
p
Assume
interval
its
and
F
V(Bob)
is
E
Next,

\E\
.6/

Finally,
T(p)
Assuming,
construct

all i e / . Moreover, (8.24) may be interpreted as

Sec.

227

now (8.26) w

Q(IEI)

F:
Figure

degrees
the
Fuzzy
p
where-Vi,V2
by
set
Fi,
An
about
this
Vj
that
linguistic
Any
p'
where
by

Bid)

(8.25)

for
(8.26)

p'
Comparing
p'

(8.27)

228

Fuzzy

where
Ei
W

(8.28)

CO),

Now,

T(p)

(8.29)

Furthermore,
possibility

Q is a fuzzy number on [0, 1], and the me

(8.30)

=
Let
quantifiers
fuzzy
shown

Most

About

previously defined. An example of a proposition of this form is the proposition "A

\
\

V
iA

0
Figure

Fuzzy
p
V2(O
where
as

i\
.

hedges. They can be used for modifying fuzzy predicates, fuzzy truth values, and fuzzy

true," may be modified by the hedge very in any of the following three ways:

is very young is true,"

Sec.

students
high."
As
simplified
p':
is young is very true,"

where

),
Ei(i)

(8.33)

for
students
Comparing
form,
(8.32)
p'
where
is very young is very true."
|il
Using
riita[P,(Vi(0),.Fi(V2())]

w
for
a
Quantifiers
second
the
kind,

8.5
Linguistic
are
of
probabilities.
is
"x
"x
"x

let the linguistic hedges very and fairly be represented by the strong

modifier *Ja. Assume now that John is 26 and,

= 0.82 = 0.64 and FAIRLY YOUNG (26) = T O = 0.8

= 0.64, and T(pi) = 0.89. These values ag

230

is less true a
Similarly,
likely,"
In
p
and
Hp
where
predicate
truth
It
truth
very
logic.
Any
[0,
while
represent
Given
the

is easy to prove that every mo

HF(x)
This
associated
Any
is
(vacuous)
A
it
weakens
consider
Pi
P2
Pi
and
weak
representing
(26)
T{pi)
assertion
It
explanatory:

%B' %R ^ se * s ^ ' ^ ' ^ respectively, by the equation

all y e Y.

us proceed now

Sec.

1.
2.
3.
4.
moreover,

A', B' are fuzzy sets on X and Y, respectively.' Then, if R and A' are g

A
h
where
and
hi
enables
by
problem
In
natural
of
is
linguistic

B' by the equation

8.6
As
These
approximate
rules,
based
Consider
assume
Then,
that
B
Assume
necessarily
B
can
Observe
XA>
X
xeX

for
Let
and
obtain

of the form

determined for all x s X and all y e Y by the formula

232

Fuzzy

Figure
two
y

3 denotes a f

(b)

(8.39)

B'(y)
for
functions
also
B'=A'R,
is
The
form.
conditional
several
As
p
p
is

R(x,y)
where

(8.40)

Sec.

(a)

(b)

Figure

Figure
inference

the following schema:

234

Using
proposition
q
we
is
Viewing
ponens
Rule:
F a c t : X i s A '
Conclusion
In
Observe
A'
Example
Let
Assume
and
A'
conclusion
Using,

this case, the compositional rule of inference has the form

by
B'iyi)

=
B'(y
x1.X

=
Thus,
Another
by
Rule:
Fact:
Conclusion
In

holds if

again expresses the compositional rule of inference. This e

Sec.

the matrix form

A'(x)
yt=Y

and
A'
Example
Let
Example
B'
A'(x{)
=
A'(x
y<sr

=
A'(x
ysY

=
Hence,
Finally,
conditional
following
Rule
Rule
Conclusion
In
fuzzy
For
(8.40).

Ri(x,y)
Ri(y,z)
Given
syllogism
Ri(x,z)
yer
which
in
R3

all b [0,1], where S is the fuzzy qualifier in (8.46). Clearly,

236

Example
Let
.5/*i
if

is to modify the truth value of 3(a, b). Note that when S stands for true (i.e.,

Then,
R,=
The

S.7
AND
The
fuzzy

all a e [0,1], then S(3(a, b)) = J(a, b), and we obtain the case
p:

where
inference
One
based
steps.
Step
RT(A
J?r(A'/A)(a)=
for
fuzzy
Step
interpreted.
to
Step
RT(B'/B)(b)=
ae[o,i]

for
S
for

S in

Sec.

The
fuzzy
Step

restrictions i

B'(y)
for
Example
Suppose
p

where
for
"V

as stated in the followi

Step
RT(A'/A){1)
T(A'/A)(.5)

RT(A'/A)(.T)
r(A'/A)(a)
Step
Step
RT(B'/B)(b)
min[.7,
for
.6
(.3
.7
(.1
.9
A
Step
B'0-i)
3'0>2)
Hence,
When
truth-value
condition,

and (8.52), respectively. Sin

Fuzzy

all x e X, we have

0.7

0.6
0.5
LJ.4

0.3
0.2
0.1

I
0.4

0.3

75

0.5

0.. 37
0. 175

Figure

Theorem
identity
sup
for
the
ponens
use
Proof:
B'(y)=
for
B'<y)
for
membership
(8.51)

A'(x)
for

),

1
0.6

<

1
0.8

0.9

'37

349

follows. Given n quantified fuzzy propositions of the form

Qt is either an absolute quantifier or a relative quant

with

Sec.

for

B'
xex

<
xaX

possible principl

<
io]
for

min[RT(A'/A)(a),3(a,B(y))]
=
<
=
for
B[(y)=
for
Observe
example,
a
two
propositions
8.8
As
p
where
2
when
In
as
Pi
where
compatible
One
quantifier

extension principle.

240

inference
p
The
/(Wi,W2
is
Pi,
functions
/(Wi,
then
special
Q
whose
f(Qi<
To
propositions

by the quantifier ex
Pi
pi

If
p
we
extension
To
by
and
in
Pi
Pi
p
where
Now,
in
f(Wi,

"'
=

Hence,

the intersection/product syllogism (8.55), we may infer t

Q is a quantifier obtained by taking the arithmetic p

the quantifiers most an

Sec.

p,
given
The
quantified
One
by
Pi
Pi.
P
where
numbers
As
form

by the following

Pi
Pl

p
where
that
extension
Wj

\E\
=
Hence,
As
Pi
P2
Using
p
where
represent
Another
expressed

Define in the form

Ass
242
Pi
p
p
where
is
Q
that
are
We
principle

NOTES
8.1.
which
developments
multivalued
and
[1980],
8.2.
inference
numerous
contributions
Dubois
[1980a,

EXERCISES
8.1.
and
8.2.
the
(assume
(a)

(b)
(c)
S3.
Lukasiewicz
8.4.
of
fuzzy

Chap.

243
A

=
-

not

5 -

A=

V
^

re

_L

Age

w=

w heavy
/
/

very

avy

250
[pounds!

0
school
Figure

244
functions
to
x
x
x
x
x
In
8.5.
arbitrary
AAB=BV(AAB)

holds.
restricted
8.6.
A'
8.7.
8.8.
those
question:
8.9.
Cathy,
set
Figs.
(a)
(b)
(c)
8.10.
reasonable

as a base for an additional treatment through which human communication and co

adequately be explicated.

should be noted at this point that the concep

terms of the theory of computability, independent of the concept of uncertainty. In this

the amount of

the shortest possible program written in some standard language (e.g., a program for

UNCERTAINTY-BASED

standard Turing machine) by which the object is described in the sense that it can
9.1
The
concept
involved
Information
incomplete,
some
types
Assume
situation
of
(finding
outcome,
the
uncertainty
Information
notion
with
does
these
application.
rich
can
It
in
approach,
of
the
245