Perfect Pavelka Logic

被引:2
|
作者
Turunen, Esko [1 ,2 ,3 ]
Navara, Mirko [1 ]
机构
[1] Czech Tech Univ, Fac Elect Engn, Dept Cybernet, Ctr Machine Percept,Tech 2, Prague 16627, Czech Republic
[2] TU Wien Austria, Vienna, Austria
[3] TU Tampere Finland, Tampere, Finland
关键词
Mathematical fuzzy logic; Rational Pavelka Logic; Lukasiewicz operations; MV-algebra; Perfect MV-algebra; Chang's MV-algebra; FUZZY LOGIC; COMPLETENESS;
D O I
10.1016/j.fss.2014.06.011
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Zadeh's Fuzzy Logic was introduced as a mathematical tool for deduction working with different degrees of truth, instead of the two truth degrees of Classical Logic. The next step taken by Pavelka was to admit assumptions and theorems which are also satisfied only to some truth degree, as well as deduction rules transferring these degrees to the deduced formulas. In the semantics these possibly, but not necessarily, correspond to the degrees of satisfaction of formulas. A significant consequent progress towards this direction was achieved by Hajek's work on Rational Pavelka Logic; it forms formulas with graded truth as couples of a formula and a rational truth value. The success of the Rational Pavelka Logic follows from the properties of the standard MV-algebra, i.e. the real unit interval [0, 1] with the Lukasiewicz operations, which was used as its semantical interpretation. The main mathematical result is that the Rational Pavelka Logic is sound and complete in the sense that the syntactical provability degree and the semantical degree of satisfaction coincide. In this paper an alternative to Pavelka's approach is investigated. Instead of the standard MV-algebra, the truth values are taken from a perfect MV-algebra, in particular, Chang's MV-algebra. This is the opposite extreme among MV-algebras, it admits only infinitesimals besides the two classical truth degrees. We argue that such an example also has a motivation in deduction imitating human reasoning. As Chang's MV-algebra is not complete, the provability degree need not exist. Nevertheless, as the main result the following weak completeness theorem is proved: If the provability degree of a formula exists, it coincides with the degree of satisfaction. This result is obtained by adding to Pavelka's original approach a new rule of inference, Hajek's book-keeping axioms and an axiom valid in Chang's MV-algebra. An example that clarifies the differences between Classical Logic, Rational Pavelka Logic and Perfect Pavelka Logic is given, and some new fuzzy rules of inference are introduced. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:396 / 410
页数:15
相关论文
共 50 条
  • [1] Infinitesimals and Pavelka logic
    Turunen, Esko
    Navara, Mirko
    PROCEEDINGS OF THE 2015 CONFERENCE OF THE INTERNATIONAL FUZZY SYSTEMS ASSOCIATION AND THE EUROPEAN SOCIETY FOR FUZZY LOGIC AND TECHNOLOGY, 2015, 89 : 1027 - 1033
  • [2] A NOTE ON PAVELKA FUZZY-LOGIC
    TURUNEN, E
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1991, 37 (01): : 39 - 40
  • [3] Graded tableaux for Rational Pavelka Logic
    Di Lascio, L
    Gisolfi, A
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2005, 20 (12) : 1273 - 1285
  • [4] Rational Pavelka predicate logic is a conservative extension of Lukasiewicz predicate logic
    Hájek, P
    Paris, J
    Shepherdson, J
    JOURNAL OF SYMBOLIC LOGIC, 2000, 65 (02) : 669 - 682
  • [5] Algebraic logic for rational Pavelka predicate calculus
    Dragulici, D
    Georgescu, G
    MATHEMATICAL LOGIC QUARTERLY, 2001, 47 (03) : 315 - 326
  • [6] Pavelka-style fuzzy logic in retrospect and prospect
    Belohlavek, Radim
    FUZZY SETS AND SYSTEMS, 2015, 281 : 61 - 72
  • [7] Rational Pavelka logic: The best among three worlds?
    Hanikova, Zuzana
    FUZZY SETS AND SYSTEMS, 2023, 456 : 92 - 106
  • [8] Pavelka-style completeness in expansions of Łukasiewicz logic
    Hector Freytes
    Archive for Mathematical Logic, 2008, 47 : 15 - 23
  • [9] Pavelka-style completeness in expansions of Lukasiewicz logic
    Freytes, Hector
    ARCHIVE FOR MATHEMATICAL LOGIC, 2008, 47 (01) : 15 - 23
  • [10] Paraconsistent semantics for Pavelka style fuzzy sentential logic
    Turunen, E.
    Ozturk, M.
    Tsoukias, A.
    FUZZY SETS AND SYSTEMS, 2010, 161 (14) : 1926 - 1940