A method of constructing fast algorithms in the k-valued logic (Q1821094)
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 3997760
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A method of constructing fast algorithms in the k-valued logic |
scientific article; zbMATH DE number 3997760 |
Statements
A method of constructing fast algorithms in the k-valued logic (English)
0 references
1985
0 references
Various problems in multivalued logics, in particular problems related to functional completeness, often require solving the question on membership of a given function in a given closed class. The present article describes a general method of constructing fast algorithms for detecting whether functions of multivalued logic belong to classes defined by predicates, and produces examples of applications of this method.
0 references
functional completeness
0 references
closed class
0 references
functions of multivalued logic
0 references
0.8143242597579956
0 references
0.7911710739135742
0 references
0.7780249714851379
0 references
