Complexity of some language fragments of fuzzy logics (Q1699732)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of some language fragments of fuzzy logics |
scientific article; zbMATH DE number 6843089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of some language fragments of fuzzy logics |
scientific article; zbMATH DE number 6843089 |
Statements
Complexity of some language fragments of fuzzy logics (English)
0 references
23 February 2018
0 references
This article analysis whether fuzzy logics (MTL and its extension) can be reduced to their implicational fragments. In particular, it is shown that (a) the semigroup reducts can generate a chain of subvarietes of commutative semigroups and (b) the implicational fragments of BL and some of its extensions are polynomial equivalent to the full logic. The author discusses consequences of the obtained results and, at the end of article, she presents several open problems.
0 references
fuzzy logics
0 references
substructural logic
0 references
complexity
0 references
0 references
0.8134886026382446
0 references
0.7905572652816772
0 references
0.7833054661750793
0 references
0.7628863453865051
0 references
0.7552674412727356
0 references
