The persistence principle over weak interpretability logic
From MaRDI portal
Abstract: We focus on the persistence principle : over the weak sublogic of the basic interpretability logic . We study the logic obtained by adding into from several perspectives. First, we prove that enjoys a weak version of the fixed point property. Secondly, we introduce a system of sequent calculus for , and prove the cut-elimination theorem for it. As a consequence, we prove that enjoys the Craig interpolation property. Thirdly, we show that is the natural basis of a generalization of simplified Veltman semantics, and prove that has the finite frame property with respect to that semantics. Finally, we prove that 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)