Lattice Structure of Some Closed Classes for Non-binary Logic and Its Applications

Kalimulina, Elmira Yu.

doi:10.1007/978-3-030-96401-6_2

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A comprehensive analysis of the use of k-valued logic in various applications has been provided in the research paper [9]. Among the wide range of applications, data aggregation schemes stand out because the development of three-valued logic algorithms has proven to be drastically more efficient and cost-effective than two-valued logic [13,14]. In particular, it is effective in providing a stable Internet connection for users in high-speed trains outside areas with stable cellular network coverage.…”

Section: Introductionmentioning

confidence: 99%

Finiteness of One-Valued Function Classes in Many-Valued Logic

Kalimulina

2023

Fractal Fract

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%