加载中…
We generalize methods, developed by S. Ghilardi, and apply them to a subsystem J of bimodal provability logic GLB. We describe projective formulas in J in terms of Kripke semantics and prove that logic J has finitary unification type. As an application, we show that admissibility problem for J is decidable.

生成讲解博客的中文版本

生成AI智能校验的中文版本