Residuated Basic Logic II. Interpolation, Decidability and Embedding

Por • 30 abr, 2014 • Sección: Ciencia y tecnología

Minghui Ma, Zhe Lin

Abstract: We prove that the sequent calculus LRBL for residuated basic logic RBL has strong finite model property, and that intuitionistic logic can be embedded into basic propositional logic BPL . Thus RBL is decidable. Moreover, it follows that the class of residuated basic algebras has the finite embeddability property, and that BPL is PSPACE-complete, and that intuitionistic logic can be embedded into the modal logic K4 .

arXiv:1404.7401v1 [math.LO]

Logic (math.LO); Logic in Computer Science (cs.LO)

Post to Twitter

Escribe un comentario