Formal fuzzy logic: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Giangiacomo Gerla
No edit summary
imported>Giangiacomo Gerla
Line 67: Line 67:
The ''fuzzy'' <math>\and</math>''-introduction rule'' is a totally defined rule such that ''r''(<math>\alpha_1,\alpha_2) = \alpha_1\and \alpha_2 </math> and again <math>s(\lambda_1,\lambda_2) = \lambda_1\otimes\lambda_2</math>. This rule says that if we are able to prove <math>\alpha_1</math> and <math>\alpha_2</math> at degree <math>\lambda_1</math> and <math>\lambda_2</math>, respectively, then we can prove <math>\alpha_1\and \alpha_2</math> at degree <math>\lambda_1\otimes \lambda_2</math>.  
The ''fuzzy'' <math>\and</math>''-introduction rule'' is a totally defined rule such that ''r''(<math>\alpha_1,\alpha_2) = \alpha_1\and \alpha_2 </math> and again <math>s(\lambda_1,\lambda_2) = \lambda_1\otimes\lambda_2</math>. This rule says that if we are able to prove <math>\alpha_1</math> and <math>\alpha_2</math> at degree <math>\lambda_1</math> and <math>\lambda_2</math>, respectively, then we can prove <math>\alpha_1\and \alpha_2</math> at degree <math>\lambda_1\otimes \lambda_2</math>.  


A proof <math>\pi</math> of a formula <math>\alpha</math> is a
A ''proof'' <math>\pi</math> of a formula <math>\alpha</math> is a
sequence <math>\alpha _1,...,\alpha _m</math> of formulas such that <math>\alpha _m=\alpha </math>,
sequence <math>\alpha_1,...,\alpha_m</math> of formulas such that <math>\alpha_m=\alpha </math>,
together with a sequence of related ''justifications''. This means that, for
together with a sequence of related ''justifications''. This means that, for
every formula <math>\alpha _i</math>, we have to specify whether
every formula <math>\alpha_i</math>, we have to specify whether


i) <math>\alpha _i</math> is assumed as a logical axiom or;
i) <math>\alpha_i</math> is assumed as a logical axiom or;


ii) <math>\alpha _i</math> is assumed as a proper axiom or;
ii) <math>\alpha_i</math> is assumed as a proper axiom or;


iii) <math>\alpha _i</math> is obtained by a rule (in this case we have to indicate
iii) <math>\alpha_i</math> is obtained by a rule (in this case we have to indicate
also the rule and the formulas from <math>\alpha _1,...,\alpha _{i-1}</math> used to
also the rule and the formulas from <math>\alpha_1,...,\alpha_{i-1}</math> used to
obtain <math>\alpha _i</math>).
obtain <math>\alpha_i</math>).


The justifications are necessary to valuate the proofs. Let ''v'' be any fuzzy set of formulas and, for every <math>i\leq m</math> denote by <math>\pi (i)</math> the proof <math>  
The justifications are necessary to valuate the proofs. Let ''v'' be any fuzzy set of formulas and, for every <math>i\leq m</math> denote by <math>\pi (i)</math> the proof <math>  
\alpha_1,...,\alpha_i</math>. Then the valuation <math>Val(\pi ,v)</math> of <math>\pi</math> with
\alpha_1,...,\alpha_i</math>. Then the valuation <math>Val(\pi ,v)</math> of <math>\pi</math> with
respect to ''v is defined by induction on ''m'' by
respect to ''v is defined by induction on ''m'' by setting


<math>Val(\pi ,v)=a(\alpha_m)</math> if <math>\alpha _m</math> is assumed as a logical axiom
<math>Val(\pi ,v)=a(\alpha_m)</math> if <math>\alpha _m</math> is assumed as a logical axiom
Line 88: Line 88:
<math> Val(\pi ,v)=v(\alpha_m)</math> if <math>\alpha _m</math> is assumed as a proper axiom
<math> Val(\pi ,v)=v(\alpha_m)</math> if <math>\alpha _m</math> is assumed as a proper axiom


<math>Val(\pi ,v)=r^{\prime \prime }(Val(\pi (i_1),v),...,Val(\pi (i_n),v))</math> if <math>
<math>Val(\pi ,v) = s(Val(\pi(i_1),v),...,Val(\pi (i_n),v))</math> if there is fuzzy rule <math>(r,s)</math> such that <math>
\alpha _m=r^{\prime }(\alpha_{i1},...,\alpha_{in})</math> with <math>i_1<m,...,i_n<m</math>.
\alpha_m = r(\alpha_{i(1)},...,\alpha_{i(n)})</math> with <math>i_1 < m,...,i_n < m</math>.


Now, unlike the crisp deduction systems, in a fuzzy deduction system
Now, unlike the crisp deduction systems, in a fuzzy deduction system
Line 95: Line 95:


<math>
<math>
D(v)(\alpha )= Sup\{Val(\pi ,v)\;|\;\pi \;</math> ''is a proof of'' <math>\alpha\}</math>.
D(v)(\alpha)= Sup\{Val(\pi ,v)|\pi </math> ''is a proof of'' <math>\alpha\}</math>.


This formula defines, for every initial valuation ''v'', a fuzzy subset ''D(v)''
This formula defines, for every initial valuation ''v'', a fuzzy subset ''D(v)''

Revision as of 01:55, 29 August 2007

Template:TOC-right

Formal fuzzy logic

Under the name "fuzzy logic" one denotes a series of topics related with the notion of fuzzy subset. Usually fuzzy logic is devoted to the applications, nevertheless, under the name "formal fuzzy logic" or "fuzzy logic in narrow sense" one denotes a new chapter of formal logic. Its aim is to represent in a formal way the vagueness of the natural language and to formalize the reasonings involving notions which are vague in nature.

We can also consider formal fuzzy logic as an evolution and an enlargement of multi-valued logic. As a matter of fact, the fuzzy logics usually proposed have a semantics which is not different from the usual truth-functional semantics of a first order multi-valued logic. In addition there are fuzzy logic whose semantics is not truth-functional (as an example, see necessity logic and probability logic) and also fuzzy logics whith no semantics (see similarity logic) since are obtained by a fuzzyfication of the metalogic we use for classical logic.

In any case the main difference with the traditional multi-valued logic one manifests in the deduction apparatus. This since in multi-valued logic the deduction operator is a tool to associate every (classical) set of axioms with the related (classical) set of theorems. From such a point of view the paradigm of the deduction in multi-valued logic is not different in nature from the one of classical logic. Instead in fuzzy logic the notion of approximate reasoning is crucial and this leads to define a deduction operator working from a fuzzy set of proper axioms (the available information) to give the related fuzzy subset of consequences.

The semantics

Consider a first order language L whose set of formulas we denote by F. As in classical logic, in fuzzy logic an interpretation of L is obtained by a domain D and by a function I associating every constant in L with an element of D and every n-ary operation symbol in L with an n-ary function in D. Instead, the interpretation of the predicate names is different since an n-ary predicate symbol is interpreted by an n-ary fuzzy relation in D, i.e. a map r from to [0,1]. This enables us to represent properties which are "vague" in nature.

Definition. Given a first order language F, a fuzzy interpretation is a pair (D,I) such that D is a nonempty set and I a map associating

- every operation name h with arity n with an n-ary operation in D,

- every constant c with an element I(c) in D

- every n-ary predicate name r with an n-ary fuzzy relation in D.

Every fuzzy interpretation defines a valuation of the set F of formulas. Given a term t its interpretation is a function one defines as in classical logic.

Definition. Given a formula whose free variables are in , we define the truth degree of by induction on the complexity of by setting

-

-

-

- ~

-


As usual, if is a closed formula, then its valuation does not depend on the elements and we write instead of . More in general, given any formula , we denote by , the valuation of the universal closure of .


Definition. Consider a fuzzy set 's' of formulas we interpret as the fuzzy subset of proper axioms. Then we say that a fuzzy interpretation (D,I) is a model of s, in brief if .


Then the meaning of a fuzzy subset of proper axioms s is that for every sentence , the value is a "lower bound constraint" on the unknown truth value of .

Definition. The logical consequence operator is the map defined by setting

.

Again, the value is a "lower bound constraint" on the unknown truth value of . As a matter of fact this is the better constraint we can find given the information s. It is easy to see that is a closure operator, i.e. that

.

The deduction apparatus: approximate reasonings

Once we have defined the logical consequence operator Lc, we have to search for a "deduction apparatus" able to calculate Lc(s) in some way. As an example, by extending the Hilbert's aproach, we can define a deduction apparatus by a fuzzy subset of formulas la we call fuzzy subset of logical axioms and by a set R of fuzzy inference rules. In turn, and inference rule is a pair (r,s) where r is a partial n-ary operation in F (i.e. an inference rule in the usual sense) and s is an n-ary operation in [0,1]. The meaning of an inference rule is:

- if we are able to prove at degree , respectively

- and we can apply r to

- then we can prove at degree .

As an example, let be an operation in [0,1] able to interpret the conjunction. Then the fuzzy Modus Ponens is defined as the pair in which the domain of r is the set , and . This rule says that if we are able to prove and at degree and , respectively, then we can prove at degree .

The fuzzy -introduction rule is a totally defined rule such that r( and again . This rule says that if we are able to prove and at degree and , respectively, then we can prove at degree .

A proof of a formula is a sequence of formulas such that , together with a sequence of related justifications. This means that, for every formula , we have to specify whether

i) is assumed as a logical axiom or;

ii) is assumed as a proper axiom or;

iii) is obtained by a rule (in this case we have to indicate also the rule and the formulas from used to obtain ).

The justifications are necessary to valuate the proofs. Let v be any fuzzy set of formulas and, for every denote by the proof . Then the valuation of with respect to v is defined by induction on m by setting

if is assumed as a logical axiom

if is assumed as a proper axiom

if there is fuzzy rule such that with .

Now, unlike the crisp deduction systems, in a fuzzy deduction system different proofs of a same formula may give different contributions to the degree of validity of . This suggests setting

is a proof of .

This formula defines, for every initial valuation v, a fuzzy subset D(v) we call the fuzzy set of formulas deduced from v. Also, we call deduction operator the function D so defined, i.e., the operator associating any fuzzy subset v of hypotheses with the fuzzy subset D(v) of its consequences. ( (to be continued) ...

Is fuzzy logic a proper extension of classical logic ?

The interpretation of the logical connectives in fuzzy logic is conservative in the sense that its restriction to {0,1} coincides with the classical one. This fact can be interpreted by saying that fuzzy logic is conservative and that it is a proper extension of classical logic. On the other hand it is evident also that fuzzy logic is defined inside classical mathematics and therefore inside classical logic. Then, as a matther of fact fuzzy logic is a (small) chapter of classical mathematics. This means that, differently from intuitionistic logic, fuzzy logic cannot be considered as an alternative philosophy in a trict sense.

Effectiveness for fuzzy subsets

The notions of a "decidable subset" and "recursively enumerable subset" are basic ones for classical mathematics and classical logic. Then, the question of a suitable extension of such concepts to fuzzy set theory arises. A first proposal in such a direction was made by E.S. Santos by the notions of fuzzy Turing machine, Markov normal fuzzy algorithm and fuzzy program. Successively, L. Biacino and G. Gerla proposed the following definition where Ü denotes the set of rational numbers in [0,1].

Definition A fuzzy subset μ : S [0,1] of a set S is recursively enumerable if a recursive map h : S×N Ü exists such that, for every x in S, the function h(x,n) is increasing with respect to n and μ(x) = lim h(x,n). We say that μ is decidable if both μ and its complement –μ are recursively enumerable.

An extension of such a theory to the general case of the L-subsets is proposed in a paper by G. Gerla where one refers to the theory of effective domains. It is an open question to give supports for a Church thesis for fuzzy logic claiming that the proposed notion of recursive enumerability for fuzzy subsets is the adequate one. To this aim, further investigations on the notions of fuzzy grammar and fuzzy Turing machine should be necessary (see for example Wiedermann's paper).

Effectiveness for fuzzy logic

Define the set Val of valid formulas as the set of formulas assuming constantly value equal to 1. Then it is possible to prove that among the usual first order logics only Goedel logic has a recursively enumerable set of valid formulas. In the case of Lukasiewicz and product logic, for example, Val is not recursively enumerable (see B. Scarpellini, Belluce). Such a fact was extensively examined in the book of Hajek. Neverthless, from these results we cannot conclude that these logics are not effective and therefore that an axiomatization is not possible. Indeed, if we refer to the just exposed notion of effectiveness for fuzzy sets, then the following theorem holds true (provided that the deduction apparatus of the fuzzy logic satisfies some obvious effectiveness property).

Theorem. Any axiomatizable fuzzy theory is recursively enumerable. In particular, the fuzzy set of logically true formulas is recursively enumerable in spite of the fact that the crisp set of valid formulas is not recursively enumerable, in general. Moreover, any axiomatizable and complete theory is decidable.

It is an open question to utilize the notion of recursively enumerable fuzzy subset to find an extension of Gödel’s theorems to fuzzy logic.

See also

Bibliography

  • Biacino L., Gerla G., Fuzzy logic, continuity and effectiveness, Archive for Mathematical Logic, 41, (2002), 643-667.
  • Chang C. C.,Keisler H. J., Continuous Model Theory, Princeton University Press, Princeton, 1996.
  • Cignoli R., D’Ottaviano I. M. L. , Mundici D. , ‘’Algebraic Foundations of Many-Valued Reasoning’’. Kluwer, Dordrecht, 1999.
  • Cox E., The Fuzzy Systems Handbook (1994), ISBN 0-12-194270-8
  • Elkan C.. The Paradoxical Success of Fuzzy Logic. November 1993. Available from Elkan's home page.
  • Hájek P., Metamathematics of fuzzy logic. Kluwer 1998.
  • Hájek P., Fuzzy logic and arithmetical hierarchy, Fuzzy Sets and Systems, 3, (1995), 359-363.
  • Klir G. and Folger T., Fuzzy Sets, Uncertainty, and Information (1988), ISBN 0-13-345984-5.
  • Klir G. and Bo Yuan, Fuzzy Sets and Fuzzy Logic (1995) ISBN 0-13-101171-5
  • Gerla G., Effectiveness and Multivalued Logics, Journal of Symbolic Logic, 71 (2006) 137-162.
  • Montagna F., Three complexity problems in quantified fuzzy logic. Studia Logica, 68,(2001), 143-152.
  • Novák V., Perfilieva I, Mockor J., Mathematical Principles of Fuzzy Logic, Kluwer Academic Publishers, Dordrecht, (1999).
  • Scarpellini B., Die Nichaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Łukasiewicz, J. of Symbolic Logic, 27,(1962), 159-170.
  • Zimmermann H., Fuzzy Set Theory and its Applications (2001), ISBN 0-7923-7435-5.
  • Kevin M. Passino and Stephen Yurkovich, Fuzzy Control, Addison Wesley Longman, Menlo Park, CA, 1998.
  • Wiedermann J. , Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines, Theor. Comput. Sci. 317, (2004), 61-69.
  • Zadeh L.A., Fuzzy algorithms, Information and Control, 5,(1968), 94-102.
  • Zadeh L.A., Fuzzy Sets, ‘’Information and Control’’, 8 (1965) 338­353.
  • Zemankova-Leech, M., Fuzzy Relational Data Bases (1983), Ph. D. Dissertation, Florida State University.