The completeness criterion for \(S\)-sets of determinate functions (Q3589276)
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: The completeness criterion for S-sets of determinate functions |
scientific article; zbMATH DE number 5788345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The completeness criterion for \(S\)-sets of determinate functions |
scientific article; zbMATH DE number 5788345 |
Statements
20 September 2010
0 references
completeness
0 references
\(S\)-set
0 references
\(k\)-valued logic
0 references
finite automata
0 references
semi-completeness
0 references
0.8954493403434753
0 references
0.8762440085411072
0 references
0.8339588642120361
0 references
0.814956545829773
0 references
