an:00125240
Zbl 0767.03007
Rybakov, V. V.
The universal theory of the free pseudoboolean algebra \(F_ \omega{}(H)\) in the signature extended by constants for free generators
EN
Algebra, Proc. Int. Conf. Memory A. I. Mal'cev, Novosibirsk/USSR 1989, Contemp. Math. 131, Pt. 3, 645-656 (1992).
1992
a
03B25 08B20 06D20 03G10 03B20
Heyting's intuitionistic propositional calculus \(H\); algorithmic solvability of logical equations in \(H\); intuitionistic Kripke models; decidability
[For the entire collection see Zbl 0745.00034.]
\textit{H. Friedman} [J. Symb. Logic 40, 113-129 (1975; Zbl 0318.02002)] has raised the problem of the existence of an algorithm recognizing admissibility of inferential rules in Heyting's intuitionistic propositional calculus \(H\). Using special intuitionistic Kripke models, the author solves a generalization of Friedman's problem and proves the algorithmic solvability of logical equations in \(H\). An algebraic corollary of these results is the decidability of the theory in the title.
S.Rudeanu (Bucure??ti)
Zbl 0745.00034; Zbl 0318.02002