Computational complexities of axiomatic extensions of monoidal t-norm based logic (Q2391235)
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: Computational complexities of axiomatic extensions of monoidal t-norm based logic |
scientific article; zbMATH DE number 5586583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexities of axiomatic extensions of monoidal t-norm based logic |
scientific article; zbMATH DE number 5586583 |
Statements
Computational complexities of axiomatic extensions of monoidal t-norm based logic (English)
0 references
24 July 2009
0 references
computational complexity
0 references
axiomatic extension of monoidal t-norm-based logic
0 references
NM
0 references
nilpotent minimum t-norm
0 references
SMTL
0 references
left-continuous strict t-norm
0 references
satisfiable formula
0 references
tautology
0 references
0 references
0.8053733706474304
0 references
0.8047683238983154
0 references
0.7997644543647766
0 references
0.7977278232574463
0 references
0.791165828704834
0 references
