×

zbMATH — the first resource for mathematics

A method of constructing fast algorithms in the k-valued logic. (English. Russian original) Zbl 0616.03011
Math. Notes 38, 595-600 (1985); translation from Mat. Zametki 38, No. 1, 148-156 (1985).
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.
MSC:
03B50 Many-valued logic
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] S. V. Yablonskii, ?Functional constructions in the k-valued logic,? Tr. Mat. Inst. Akad. Nauk SSSR,51, 5-142 (1958).
[2] A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (1974). · Zbl 0326.68005
[3] A. Schonhage and V. Strassen, ?Schnelle Multiplikation grosser Zahlen,? Computing,7, No. 3-4, 281-292 (1971). · Zbl 0223.68007 · doi:10.1007/BF02242355
[4] N. R. Emel’yanov, ?On complexity of the expressibility problem in multivalued logics,? Dokl. Akad. Nauk SSSR,282, No. 3, 525-529 (1985).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.