Abstract <p>We give a simple proof of a result recently obtained in [12] on the completeness of modal logics with modality that corresponds to the intersection of accessibility relations in a Kripke model. Completeness is proved for logics in modal languages of two types: one has modalities <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11472_2025_9876_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="81" /> </InlineMediaObject> <EquationSource Format="TEX">\({{\square }_{1}}, \ldots ,{{\square }_{n}}\)</EquationSource> <!--DANMath2570002Zolin-m1--> </InlineEquation> for relations <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11472_2025_9876_Article_IEq2.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="80" /> </InlineMediaObject> <EquationSource Format="TEX">\({{R}_{1}}, \ldots ,{{R}_{n}}\)</EquationSource> <!--DANMath2570002Zolin-m2--> </InlineEquation> that satisfy a unimodal logic <i>L</i> and modality <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11472_2025_9876_Article_IEq3.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="37" /> </InlineMediaObject> <EquationSource Format="TEX">\({{\square }_{{n + 1}}}\)</EquationSource> <!--DANMath2570002Zolin-m3--> </InlineEquation> for the intersection <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11472_2025_9876_Article_IEq4.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="157" /> </InlineMediaObject> <EquationSource Format="TEX">\({{R}_{{n + 1}}} = {{R}_{1}} \cap \ldots \cap {{R}_{n}}\)</EquationSource> <!--DANMath2570002Zolin-m4--> </InlineEquation>; the other language has modalities <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11472_2025_9876_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="70" /> </InlineMediaObject> <EquationSource Format="TEX">\({{\square }_{i}}(i \in \Sigma )\)</EquationSource> <!--DANMath2570002Zolin-m5--> </InlineEquation> for relations <i>R</i><sub><i>i</i></sub> that satisfy the logic <i>L</i>, and, for every nonempty subset of indices <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11472_2025_9876_Article_IEq6.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(I \subseteq \Sigma \)</EquationSource> <!--DANMath2570002Zolin-m6--> </InlineEquation>, the modality <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11472_2025_9876_Article_IEq7.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\({{\square }_{I}}\)</EquationSource> <!--DANMath2570002Zolin-m7--> </InlineEquation> for the intersection <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11472_2025_9876_Article_IEq8.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="56" /> </InlineMediaObject> <EquationSource Format="TEX">\(\bigcap\nolimits_{i \in I} {{R}_{i}}\)</EquationSource> <!--DANMath2570002Zolin-m8--> </InlineEquation>. While in [12] the completeness is proved only for logics over <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11472_2025_9876_Article_IEq9.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="151" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathbf{K,KD,KT,K4,S4}}\)</EquationSource> <!--DANMath2570002Zolin-m9--> </InlineEquation>, and <b>S5</b>, we give a “uniform” construction that enables us to obtain completeness for logics with intersection over 15 “traditional” modal logics <b>K</b>Λ for <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11472_2025_9876_Article_IEq10.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="148" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Lambda \subseteq \{ {\mathbf{D,T,B,4,5}}\} \)</EquationSource> <!--DANMath2570002Zolin-m10--> </InlineEquation>. The proof method is based on unraveling a frame and then taking the Horn closure of the resulting frame.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Modal Logics with Intersection Modality

  • E. E. Zolin

摘要

Abstract

We give a simple proof of a result recently obtained in [12] on the completeness of modal logics with modality that corresponds to the intersection of accessibility relations in a Kripke model. Completeness is proved for logics in modal languages of two types: one has modalities \({{\square }_{1}}, \ldots ,{{\square }_{n}}\) for relations \({{R}_{1}}, \ldots ,{{R}_{n}}\) that satisfy a unimodal logic L and modality \({{\square }_{{n + 1}}}\) for the intersection \({{R}_{{n + 1}}} = {{R}_{1}} \cap \ldots \cap {{R}_{n}}\) ; the other language has modalities \({{\square }_{i}}(i \in \Sigma )\) for relations Ri that satisfy the logic L, and, for every nonempty subset of indices \(I \subseteq \Sigma \) , the modality \({{\square }_{I}}\) for the intersection \(\bigcap\nolimits_{i \in I} {{R}_{i}}\) . While in [12] the completeness is proved only for logics over \({\mathbf{K,KD,KT,K4,S4}}\) , and S5, we give a “uniform” construction that enables us to obtain completeness for logics with intersection over 15 “traditional” modal logics KΛ for \(\Lambda \subseteq \{ {\mathbf{D,T,B,4,5}}\} \) . The proof method is based on unraveling a frame and then taking the Horn closure of the resulting frame.