On the relation between depth and complexity of formulas in precomplete classes of \(k\)-valued logic (Q3604270)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5510980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the relation between depth and complexity of formulas in precomplete classes of \(k\)-valued logic |
scientific article; zbMATH DE number 5510980 |
Statements
24 February 2009
0 references
\(k\)-valued logic
0 references
depth
0 references
complexity
0 references
homogeneous system
0 references
precomplete class
0 references
0.924546480178833
0 references
0.9222959876060486
0 references
0.8314071297645569
0 references
0.8286372423171997
0 references
0.8169386982917786
0 references
