CRITERIA FOR ADMISSIBILITY OF RULES OF INFERENCE WITH PARAMETERS IN THE INTUITIONISTIC PROPOSITIONAL CALCULUS

The author studies the problem of recognizing admissibility of rules of inference of a general form - rules of inference with parameters - in the intuitionistic propositional calculus. Algorithmic and semantic criteria are found for recognizing admissibility of such rules, based on special intuitionistic Kripke models. In particular, Friedman's problem generalized to rules of inference with parameters is solved. These results are applied to recognizing the solvability of logical equations and constructing their solutions.