It was proved that the simplest non-classical provability propositional logic has 40 precomplete with respect to functional expressibility classes of formulas. It was proved that if a propositional provability logic L is not local tabular, then there are infinitely many precomplete as to functional expressibility classes of formulas in it. It was also proved that L poseses functional bases of any finite rank.