The persistence principle over weak interpretability logic

From MaRDI portal




Abstract: We focus on the persistence principle mathbfP: AhdBoBox(AhdB) over the weak sublogic mathbfIL− of the basic interpretability logic mathbfIL. We study the logic mathbfIL−(mathbfP) obtained by adding mathbfP into mathbfIL− from several perspectives. First, we prove that mathbfIL−(mathbfP) enjoys a weak version of the fixed point property. Secondly, we introduce a system of sequent calculus for mathbfIL−(mathbfP), and prove the cut-elimination theorem for it. As a consequence, we prove that mathbfIL−(mathbfP) enjoys the Craig interpolation property. Thirdly, we show that mathbfIL−(mathbfP) is the natural basis of a generalization of simplified Veltman semantics, and prove that mathbfIL−(mathbfP) has the finite frame property with respect to that semantics. Finally, we prove that mathbfIL−(mathbfP) is sound and complete with respect to some appropriate arithmetical semantics.














This page was built for publication: The persistence principle over weak interpretability logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6392768)