On the length of functions of κ-valued logic in the class of polynomial normal forms modulo κ
-
Maksim A. Bashov
and
Svetlana N. Selezneva
Abstract
Polynomial normal forms for functions of κ-valued logics (for prime values of κ) are considered. A polynomial normal form modulo κ (p.n.f.) is the sum modulo κ of products of variables, or variables with one or several Post negations, taken with some coefficients. The length of a p.n.f. is the number of distinct terms that appear in the form with nonzero coefficients. If κ is a prime number, then each function of κ-valued logic may be represented by various p.n.f. The length of a function of κ-valued logic in the class of p.n.f. is the minimum length of a p.n.f. representing this function. The Shannon function Lp.n.f.κ (n) of the length of functions of κ-valued logic in the class of p.n.f. is the maximum length of a function in the class of p.n.f. among all n-ary functions of κ-valued logic. In thiswork the order of growth of the Shannon function Lp.n.fκ (n) is established (for prime values of κ): 
© 2015 by Walter de Gruyter Berlin/Boston
Articles in the same Issue
- Frontmatter
- Stationary distribution of the player rating in the Elo model with one adversary
- On the length of functions of κ-valued logic in the class of polynomial normal forms modulo κ
- Limit theorem for multitype critical branching process evolving in random environment
- An estimate of the approximation accuracy in B. A. Sevastyanov’s limit theorem and its application in the problem of random inclusions
- Investigation of the cryptosystem MST3 based on a Suzuki 2-group
- Images of subset of finite set under iterations of random mappings
Articles in the same Issue
- Frontmatter
- Stationary distribution of the player rating in the Elo model with one adversary
- On the length of functions of κ-valued logic in the class of polynomial normal forms modulo κ
- Limit theorem for multitype critical branching process evolving in random environment
- An estimate of the approximation accuracy in B. A. Sevastyanov’s limit theorem and its application in the problem of random inclusions
- Investigation of the cryptosystem MST3 based on a Suzuki 2-group
- Images of subset of finite set under iterations of random mappings
