Basic fuzzy logic and BL-algebras II

被引：0

作者：

P. Hájek

机构：

[1] Institute of computer science AS CR,

[2] 182 07 Prague,undefined

[3] Czech Republic E-mail: hajek@cs.cas.cz,undefined

来源：

Soft Computing | 2003年 / 7卷

关键词：

Computational Complexity; Fuzzy Logic; Predicate Logic; Basic Fuzzy Logic; Important Formula;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Three new (easy) results about the computational complexity of basic propositional fuzzy logic BL are presented. An important formula of predicate logic is shown 1-true in all interpretations over saturated BL-chains but is not a BL-1-tautology, i.e. is not 1-true in a safe interpretation over a non-saturated BL-algebra.

引用

页码：179 / 183

页数：4