Permutational representations of functions in k-valued logic

Let \(P_ k\) be the set of all functions of k-valued logic. This paper investigates so-called permutable representations of functions of \(P_ k\) by means of polynomials with coefficients modulo k. The most general result is of the form \({\mathcal K}(w_ 2)={\mathcal C}_ k(d,k_ 1,...,k_ s)\), where d is a divisor of k, \(d=k_ 1,...,k_ s\) is a decomposition of d in pairwise relatively prime factors (s\(\geq 2)\), \(w_ 2: E^ s_ k\to E_ d\) is of the form \(w_ 2(x_ 1,...,x_ s)=a_ 1x_ 1+...+a_ sx_ s (mod d)\) with \(a_ i\in E_ d\), \(a_ i\equiv 1 mod k_ i)\), \(a_ i\equiv 0 (mod d/k_ i)\), \({\mathcal K}(w_ 2)=\{f:\) \(f(w_ 2(\tilde x_ 1),...,(\tilde x_ n))=w_ 2(f(\tilde x^ 1),...,f(\tilde x^ s))\) (mod d)\(\}\) and \({\mathcal C}_ k\) is the set of congruence preserving functions of \(P_ k\) modulo d and modulo \(k_ i.\) These representations are generalizations of previously obtained results by the author.

Recommendations

Cited in

(5)

This page was built for publication: Permutational representations of functions in k-valued logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122568)