Computational complexities of axiomatic extensions of monoidal t-norm based logic (Q2391235): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00500-008-0382-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966849599 / rank | |||
Normal rank | |||
Revision as of 00:28, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexities of axiomatic extensions of monoidal t-norm based logic |
scientific article |
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
