Completeness criteria for systems of functions on a finite ring and quasi-Frobenius rings (Q1079638)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Completeness criteria for systems of functions on a finite ring and quasi-Frobenius rings
scientific article

    Statements

    Completeness criteria for systems of functions on a finite ring and quasi-Frobenius rings (English)
    0 references
    0 references
    1983
    0 references
    Let K be a finite not necessarily associative ring and let \(P_ K\) be the class of all functions of finitely many variables on K with values in K. Let A be an arbitrary system of functions in \(P_ K\) and [A] be the closure of A as a system of functions of a \(| K|\)-valued logic. The system A is said to be complete if \([A]=P_ K.\) Main result: Theorem. A system of functions A on a finite set K is complete if and only if the following conditions are satisfied: 1) System A does not preserve any nontrivial equivalence relation on K. 2) The class [A] contains all the constant functions. 3) The exist an element \(0\in K\) and functions p(x,y), s(x,y)\(\in [A]\) \(q(x_ 1,...,x_ n)\in [A]\) such that: a) \(p(x,x)=0\) and for every \(a\in K\) p(x,y) is a bijection onto K; b) \(s(x,0)=s(0,x)=x\); c) for \(n\geq 2\), \(q(x_ 1,...,x_ n)\) is not a constant and \(q(a_ 1,...,a_ n)=0\) if n-1 of the elements \(a_ 1,...,a_ n\) are equal to 0.
    0 references
    0 references
    0 references
    0 references
    0 references
    system of functions
    0 references
    \(| K| \)-valued logic
    0 references
    equivalence relation
    0 references
    constant functions
    0 references
    0 references