Density revisited

详细信息    查看全文

• 作者：George Metcalfe ; Constantine Tsinakis
• 关键词：Many ; valued logics ; Fuzzy logics ; Standard completeness ; Residuated lattices ; Semilinearity ; Density rule
• 刊名：Soft Computing
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：21
• 期：1
• 页码：175-189
• 全文大小：
• 刊物类别：Engineering
• 刊物主题：Computational Intelligence; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations; Control, Robotics, Mechatronics;
• 出版者：Springer Berlin Heidelberg
• ISSN：1433-7479
• 卷排序：21

文摘

In this (part survey) paper, we revisit algebraic and proof-theoretic methods developed by Franco Montagna and his co-authors for proving that the chains (totally ordered members) of certain varieties of semilinear residuated lattices embed into dense chains of these varieties, a key step in establishing standard completeness results for fuzzy logics. Such “densifiable” varieties are precisely the varieties that are generated as quasivarieties by their dense chains. By showing that all dense chains satisfy a certain e-cyclicity equation, we give a short proof that the variety of all semilinear residuated lattices is not densifiable (first proved by Wang and Zhao). We then adapt the Jenei–Montagna standard completeness proof for monoidal t-norm logic to show that any variety of integral semilinear residuated lattices axiomatized by additional lattice-ordered monoid equations is densifiable. We also generalize known results to show that certain varieties of cancellative semilinear residuated lattices are densifiable. Finally, we revisit the Metcalfe–Montagna proof-theoretic approach, which establishes densifiability of a variety via the elimination of a density rule for a suitable hypersequent calculus, focussing on the case of commutative semilinear residuated lattices.