We consider the problem of completeness relative to ultra-weak expressibility of the systems of formulas in the simplest non-trivial extension of the propositional provability logic. We propose an algorithm to address this ...