other,3-1-P84-1064,bq |
implementation
</term>
. Informally , a
<term>
|
disposition
|
</term>
is a
<term>
proposition
</term>
which
|
#13457
Informally, adisposition is a proposition which is preponderantly, but no necessarily always, true. |
other,6-1-P84-1064,bq |
Informally , a
<term>
disposition
</term>
is a
<term>
|
proposition
|
</term>
which is preponderantly , but no
|
#13460
Informally, a disposition is aproposition which is preponderantly, but no necessarily always, true. |
other,8-2-P84-1064,bq |
. For example , birds can fly is a
<term>
|
disposition
|
</term>
, as are the
<term>
propositions
</term>
|
#13480
For example, birds can fly is adisposition, as are the propositions Swedes are blond and Spaniards are dark. |
other,13-2-P84-1064,bq |
<term>
disposition
</term>
, as are the
<term>
|
propositions
|
</term>
Swedes are blond and Spaniards are
|
#13485
For example, birds can fly is a disposition, as are thepropositions Swedes are blond and Spaniards are dark. |
other,13-3-P84-1064,bq |
described in this paper is that a
<term>
|
disposition
|
</term>
may be viewed as a
<term>
proposition
|
#13507
An idea which underlies the theory described in this paper is that adisposition may be viewed as a proposition with implicit fuzzy quantifiers which are approximations to all and always, e.g., almost all, almost always, most, frequently, etc. |
other,19-3-P84-1064,bq |
disposition
</term>
may be viewed as a
<term>
|
proposition
|
</term>
with implicit
<term>
fuzzy quantifiers
|
#13513
An idea which underlies the theory described in this paper is that a disposition may be viewed as aproposition with implicit fuzzy quantifiers which are approximations to all and always, e.g., almost all, almost always, most, frequently, etc. |
other,22-3-P84-1064,bq |
<term>
proposition
</term>
with implicit
<term>
|
fuzzy quantifiers
|
</term>
which are approximations to all and
|
#13516
An idea which underlies the theory described in this paper is that a disposition may be viewed as a proposition with implicitfuzzy quantifiers which are approximations to all and always, e.g., almost all, almost always, most, frequently, etc. |
other,15-4-P84-1064,bq |
interpreted as the result of suppressing the
<term>
|
fuzzy quantifier
|
</term>
most in the
<term>
proposition
</term>
|
#13555
For example, birds can fly may be interpreted as the result of suppressing thefuzzy quantifier most in the proposition most birds can fly. |
other,20-4-P84-1064,bq |
fuzzy quantifier
</term>
most in the
<term>
|
proposition
|
</term>
most birds can fly . Similarly ,
|
#13560
For example, birds can fly may be interpreted as the result of suppressing the fuzzy quantifier most in theproposition most birds can fly. |
other,5-6-P84-1064,bq |
women . The process of transforming a
<term>
|
disposition
|
</term>
into a
<term>
proposition
</term>
is
|
#13590
The process of transforming adisposition into a proposition is referred to as explicitation or restoration. |
other,8-6-P84-1064,bq |
transforming a
<term>
disposition
</term>
into a
<term>
|
proposition
|
</term>
is referred to as
<term>
explicitation
|
#13593
The process of transforming a disposition into aproposition is referred to as explicitation or restoration. |
other,13-6-P84-1064,bq |
proposition
</term>
is referred to as
<term>
|
explicitation
|
</term>
or
<term>
restoration
</term>
.
<term>
|
#13598
The process of transforming a disposition into a proposition is referred to asexplicitation or restoration. |
other,15-6-P84-1064,bq |
to as
<term>
explicitation
</term>
or
<term>
|
restoration
|
</term>
.
<term>
Explicitation
</term>
sets the
|
#13600
The process of transforming a disposition into a proposition is referred to as explicitation orrestoration. |
other,0-7-P84-1064,bq |
</term>
or
<term>
restoration
</term>
.
<term>
|
Explicitation
|
</term>
sets the stage for representing the
|
#13602
The process of transforming a disposition into a proposition is referred to as explicitation or restoration.Explicitation sets the stage for representing the meaning of a proposition through the use of test-score semantics (Zadeh, 1978, 1982). |
other,7-7-P84-1064,bq |
sets the stage for representing the
<term>
|
meaning
|
</term>
of a
<term>
proposition
</term>
through
|
#13609
Explicitation sets the stage for representing themeaning of a proposition through the use of test-score semantics (Zadeh, 1978, 1982). |
other,10-7-P84-1064,bq |
representing the
<term>
meaning
</term>
of a
<term>
|
proposition
|
</term>
through the use of
<term>
test-score
|
#13612
Explicitation sets the stage for representing the meaning of aproposition through the use of test-score semantics (Zadeh, 1978, 1982). |
other,15-7-P84-1064,bq |
proposition
</term>
through the use of
<term>
|
test-score semantics
|
</term>
( Zadeh , 1978 , 1982 ) . In this
|
#13617
Explicitation sets the stage for representing the meaning of a proposition through the use oftest-score semantics (Zadeh, 1978, 1982). |
other,4-8-P84-1064,bq |
1978 , 1982 ) . In this approach to
<term>
|
semantics
|
</term>
, the
<term>
meaning
</term>
of a
<term>
|
#13631
In this approach tosemantics, the meaning of a proposition, p, is represented as a procedure which tests, scores and aggregates the elastic constraints which are induced by p. |
other,7-8-P84-1064,bq |
approach to
<term>
semantics
</term>
, the
<term>
|
meaning
|
</term>
of a
<term>
proposition
</term>
, p ,
|
#13634
In this approach to semantics, themeaning of a proposition, p, is represented as a procedure which tests, scores and aggregates the elastic constraints which are induced by p. |
other,10-8-P84-1064,bq |
</term>
, the
<term>
meaning
</term>
of a
<term>
|
proposition
|
</term>
, p , is represented as a procedure
|
#13637
In this approach to semantics, the meaning of aproposition, p, is represented as a procedure which tests, scores and aggregates the elastic constraints which are induced by p. |