It is well known the connection of diagonalizable algebras with propositional provability logics. The notion of expressibility of functions and related algorithmic problems is very well studied in the case of boolean ...