加载中…
We prove that the sequent calculus for residuated basic logic has strong finite model property, and that intuitionistic logic can be embedded into basic propositional logic . Thus is decidable. Moreover, it follows that the class of residuated basic algebras has the finite embeddability property, and that is PSPACE-complete, and that intuitionistic logic can be embedded into the modal logic .

生成讲解博客的中文版本

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