Uniformity of systems of monotone functions
From MaRDI portal
Let \(\mathfrak U\) be a finite system of functions from \(P_k\), \(k\geq 2\), and \(\Phi\) be a formula over \(\mathfrak U\). For precomplete classes of monotone functions of \(k\)-valued logic for \(k\leq 7\) it is shown that for any finite system of functions \(A\) generating one of the classes, constants \(c\) and \(d\) are found so that for any function \(f\) from \([A]\) the depth \(D(f)\) and complexity \(L(f)\) of the function \(f\) in the class of formulas over \(A\) are correlated as \(D(f)\leq c\log_2L(f)+d\).
Recommendations
- Uniformity of a certain systems of functions of many-valued logic
- On depth and complexity of formulas in some classes of \(k\)-valued logic
- scientific article; zbMATH DE number 3918272
- Certain sufficient conditions of uniformity for systems of functions of many-valued logic
- On the relation between depth and complexity of formulas in precomplete classes of k-valued logic
Cited in
(4)- Certain sufficient conditions of uniformity for systems of functions of many-valued logic
- On the relation between depth and complexity of formulas in precomplete classes of k-valued logic
- Completeness criteria for some classes of unary monotone functions in \(P_k\)
- On depth and complexity of formulas in some classes of \(k\)-valued logic
This page was built for publication: Uniformity of systems of monotone functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1878547)
