scientific article; zbMATH DE number 1790413

From MaRDI portal
Publication:4549478





The authors contribute to the development of fuzzy logic based on Łukasiewicz many-valued logic having its syntax enriched with the operation of evaluation of a formula at some truth degree. They prove a generalization of the Herbrand theorem to this case of fuzzy logic. The generalization is based on the concept of the consistency threshold. With this theorem one can approximately characterize provability in fuzzy predicate logic using only finite methods by transforming closed formulas into Łukasiewicz disjunctions of their closed instances. Also the authors present a constructive proof of McNaughton's theorem, which states that each formula of fuzzy Łukasiewicz logic is represented by some piecewise linear function on the real interval \([0,1]\) with integer coefficients. The authors show, among some corollaries from McNaughton's theorem, that fuzzy logic is not a trivial generalization of classical logic, since in fuzzy logic the extension of some theory by a set of axioms is not equivalent to its extension by a conjunction of these axioms. In the paper a lot of theorems are given to provide purely syntactical reasoning on truth values. For the entire collection see [Zbl 0979.00015].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4549478)