Мощность решетки замкнутых классов полиномов в 𝑘-значной логике при составных 𝑘

In the world, research devoted to adjusting the results of heuristic methods based on forecasting, recognition, classification, and determining the absolute extremum of a multidimensional function is relevant and widely used in such fields as medicine, geology, hydrology, management, and computer technology. In this regard, it is important to construct optimal correctors of heuristic algorithms based on control materials. Therefore, checking the completeness of classes of k valued logical functions and developing methods and algorithms for minimizing functions in the class of canonical normal forms, estimating the number of monotonic functions of k valued logic, constructing minimal bases of special classes of correcting functions for correcting incorrect algorithms remains one of the important problems of computational and discrete science. mathematics. Currently, a lot of scientific research is being carried out around the world aimed at expanding the integration of science and industry, in particular the development of the theory of k-valued logical functions for correcting the results of heuristic algorithms. In this case, an important role is played by the construction of formulas in the class of canonical normal forms, the coding of elementary conjunctions and the application of the rules of gluing, absorption and idempotency for them, and checking the completeness of systems of correcting functions. Consequently, the development of effective numerical computational methods and algorithmsfor constructing correction functions based on k-valued logic to improve the accuracy of the results of heuristic methods is considered a targeted scientific research. The paper considers therepresentation of k-valued logical functions in the class of disjunctive normal forms. Various classes of monotone functions of k-valued logic are studied. Theorems are proved on the coincidence of abbreviated and shortest disjunctive normal forms of k-valued functions. For a certain class of k-valued monotone functions, we prove an estimate for the number of functions from this class. criteria for the absorption of elementary conjunctions by a first-order neighborhood of disjunctive normal forms of k-valued functions are proved

Realization of functions of the k-valued logic by circuits is considered over an arbitrary finite complete basis B. Asymptotic behavior of the Shannon function D B (n) of the circuit depth over B is examined. The value D B (n) is the minimal depth sufficient to realize every function of the k-valued logic of n variables by a circuit over B. It is shown that for each natural k ≥ 2 and for any finite complete basis B there exists a positive constant α B such that D B (n) ∼ α B n for n → ∞.

Objectives. The problem of circuit implementation of incompletely specified (partial) k-valued logic functions given by tabular representations is considered. The stage of technologically independent optimization is studied to obtain minimized representations of systems of completely specified Boolean functions from tabular representations of partial functions of k-valued logic. According to these representations of Boolean functions, technological mapping is performed at the second stage of the synthesis of logic circuits.Methods. Using additional definitions of Multi-valued Decision Diagrams (MDD) representing partial functions of k-valued logic, and Binary Decision Diagrams (BDD) representing partial systems of Boolean functions at the stage of technologically independent optimization is proposed. The task of additional definition of MDD is oriented to reducing the number of vertices of the MDD graph that correspond to the cofactors of the Shannon expansion of a multi-valued function.Results. The MDD minimization problem is reduced to solving the problems of coloring undirected graphs of incompatibility of cofactors by minimum number of colors. Encoding of multi-valued values of arguments and values of functions of k-valued logic by binary codes leads to systems of partial Boolean functions, which are also further defined in order to minimize their multi-level BDD representations.Conclusion. The proposed approach makes it possible to define partial multi-valued functions to fully defined Boolean functions in two stages. At the second stage, well-known and effective methods are used to redefine BDD representing systems of partial Boolean functions. As a result of this two-step approach, minimized BDD representations of systems of completely defined functions are obtained. According to completely defined Boolean functions, a technological mapping into a given library of logical elements is performed, i.e. the optimized descriptions of Boolean function systems are covered with descriptions of logical elements

Let k be a prime and G a Galois field on k:=(0,1,. . .,k-1). The set of all quasilinear (or affine with respect to G) k-valued logic functions is a maximal clone called quasilinear. A family of quasilinear clones on k is semirigid if the clones of the family share exactly the constant functions and the projections. Semirigid sets of quasilinear clones are needed for the classification of bases of k-valued logic, which is unknown for k>3. The authors characterize all semirigid sets of quasilinear clones. In particular, for k=5 they describe all semirigid triples of quasilinear clones and show that no such pair exists. For every prime k>5 they exhibit a semirigid pair of quasi-linear clones. The techniques used are based on elementary number theory and on polynomials over G. >

This paper addresses the theoretical issues in k-valued logic, which are crucial for developing solutions in various fields of science and technology. One of the fundamental issues is a complete description of the closed classes of functions of three-valued logic. The explicit description of closed classes in multivalued logic is an open problem. In this study, we consider a special case of the finite generation of all closed classes of three-valued logic through the operation of superposition. Previously, we considered the issue of the finite generation of classes containing a subset of single-variable functions. We have also provided a description of superlattices (lattices of lattices) containing a precomplete class of unary functions. The finite generation of these superlattices is proved. On the basis of these results, in this paper, we have proven that any class containing any of the precomplete classes from the set of single-valued functions is also finitely generated. The main result of this paper consists of three theorems on the finite generation of classes containing precomplete classes of single-valued functions and classes including all monotone unary functions. Thus, the obtained theoretical result provides easily verifiable criteria for the finiteness of classes of multivalued logic functions. It allows you to use simple procedures instead of cumbersome explicit constructs. The finite generation of overlattices allows the development of digital computing circuits that are crucial for practical applications. The proofs are based on an explicit description of these classes by an induction in the number of variables and essentially use the properties of functionally closed (Burle) classes of functions.

The problem of the schematic implementation of k-valued logic functions defined by tabular representations is considered. The proposed approach is based on technologically independent optimization of the representation of the k-valued logic function in the form of a multi-valued Decision Diagram (MDD), after which the values of the arguments and values of the function are encoded by sets of Boolean variables. As a result of encoding, the k-valued function is replaced by a system of not fully defined Boolean functions. The system of Boolean functions is minimized in the BDD class of representations (Binary Decision Diagram (BDD) — binary decision diagram). It is proposed to carry out intermediate encoding of the values of a k-valued function using special encoding of neighboring leaf vertices BDD, which can lead to a reduction in the area of a two-block logic circuit implementing a k-valued logic function.

The paper proposes to consider individual heuristics as unreliably operating parts of the information processing system. In a separate case, several different heuristics are adopted to solve the same problem, and the results obtained are adjusted in a certain way. In this case, problems arise that are close in methodology to the problems of synthesizing reliable circuits from unreliable elements or making a collective expert decision. The work solves the problem of constructing an optimal correction function based on control material; classes of functions of k-valued logic under monotonicity restrictions are studied. A theorem on the completeness of the class of monotonic functions of k-valued logic for arbitrary k is proved, and a basis in the given class is proved and constructed. The problem of constructing an optimal corrector in the class of disjunctive normal forms of k-valued functions is solved.

The search for the maximum upper zero for a class of monotonic functions of finite-valued logic

Search for a maximum upper zero for a class of monotonic functions in k-valued logic

Let A be a precomplete class (a maximal clone) in k-valued logic and T(A) be the family of all closed classes (under superposition) in partial k-valued logic that contain A. A simple test is put forward capable of finding out from a partial order defining the precomplete class A of monotone functions whether the family T(A) is finite or infinite. This completes the solution of the problem of finiteness of T(A) for all precomplete classes of k-valued logic. The proof depends on new families of closed classes founded by the author of the present paper.

We give a classification of dual functions, they are m-al functions. We call a function m-al with respect to an operator if the operator lives any function unchanged after m times of using the operator. And 2 ≤ m ≤ k. Functions with different m have very different properties. We give theoretical results for clones of self-dual (m = 2) and self- -al (m = k) functions in k-valued logic at k ≤ 3. And we give numerical results for clones of self-dual and self-3-al functions in 3-valued logic. In particular, the inclusion graphs of clones of self-dual and of self-3-al functions are not a lattice.

The operator of closure with respect to enumeration (the Π-operator) is defined in multivalued logic. The finiteness of the number of Π-closed classes in k-valued logic is proved. All six Π-closed classes of Boolean functions are specified. Sufficient conditions for presenting Π-closed classes in the form of classes of functions that retain certain relations are determined. The Π-closed classes are compared to positively closed classes. All Π-closed classes of homogeneous functions are described.

In this paper, some classes of discrete functions of k-valued logic are considered, that depend on sets of their variables in a particular way. The obtained results allow us to construct these functions and to present them in their tabular, analytical or matrix form, as hypercubes, and in particular as Latin hypercubes. Results connected with identifying of variables of some classes of functions are obtained.

We consider a problem of the realization of k-valued logics functions (k ≥ 3) by circuits in two bases: in the Rosser–Turkett basis and in its dual basis. We assume that the basis gates are exposed to faults at outputs: only of type 0 or only of type k − 1, and they pass into faulty states independently of each other. We describe a constructive method for the synthesis of an asymptotically optimal reliable circuit for almost any function of k-valued logic, we found the upper and lower bounds of circuits unreliability and the class of functions for which the lower bounds are true.

In recent years, the direction associated with the study of maps from a finite set A to the set of all subsets of the set A, including the empty one, has been intensively developing. Such mappings are called multifunctions on A, as well as hyperfunctions on A, if an empty subset is excluded from the subsets under consideration. It is not difficult to see that the so-called undefined or undefined functions, which are studied in many works, are most directly related to this field of research. The power of the set A is called the rank of multifunction or hyperfunction. Obviously, multifunctions and hyperfunctions generalize well-known functions of k-valued logic, however, it should be noted that the usual superposition of functions of k-valued logic is not suitable for multifunctions and hyperfunctions. Two types of superpositions are most often considered here, one of them leads to sets closed relative to the superposition, which are called multiclones and hyperclones, and for the second type of superposition, closed sets are called ultraclones and partial ultraclones. In this article, the elements of the rank 2 ultraclone lattice are considered. By now, all the maximum and minimum elements of this lattice are known. For example, Panteleev V.I. described all maximal ultraclones in the predicate language, which allowed us to prove the completeness criterion of an arbitrary system of hyperfunctions of rank 2. We managed to prove the completeness criterion in the maximal ultraclone of linear hyperfunctions of rank 2. Thus, all submaximal ultraclones of linear hyperfunctions are described.