Logical equations and admissible rules of inference with parameters in modal provability logics

This paper concerns modal logics of provability — Gödel-Löb systemGL and Solovay logicS — the smallest and the greatest representation of arithmetical theories in propositional logic respectively. We prove that the decision problem for admissibility of rules (with or without parameters) inGL andS is decidable. Then we get a positive solution to Friedman's problem forGL andS. We also show that A. V. Kuznetsov's problem of the existence of finite basis for admissible rules forGL andS has a negative solution. Afterwards we give an algorithm deciding the solvability of logical equations inGL andS and constructing some solutions.