<p>We study the finite model property of subframe logics with expressible transitive reflexive closure modality. For <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11225_2025_10207_Article_IEq4.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(m&gt;0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>&gt;</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, let <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11225_2025_10207_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="24" /> </InlineMediaObject> <EquationSource Format="TEX">\({\textsc {L}}_m\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="normal">L</mi> <mi>m</mi> </msub> </math></EquationSource> </InlineEquation> be the logic defined by axiom <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11225_2025_10207_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="124" /> </InlineMediaObject> <EquationSource Format="TEX">\(\lozenge ^{m+1} p\rightarrow \lozenge p\vee p\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>◊</mi> <mrow> <mi>m</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mi>p</mi> <mo stretchy="false">→</mo> <mi>◊</mi> <mi>p</mi> <mo>∨</mo> <mi>p</mi> </mrow> </math></EquationSource> </InlineEquation>. We construct quotient filtrations for the logics <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11225_2025_10207_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="24" /> </InlineMediaObject> <EquationSource Format="TEX">\({\textsc {L}}_m\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="normal">L</mi> <mi>m</mi> </msub> </math></EquationSource> </InlineEquation>, which implies that these logics and their tense counterparts have the finite model property. Then, we construct selective filtrations of the canonical models of <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11225_2025_10207_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="24" /> </InlineMediaObject> <EquationSource Format="TEX">\({\textsc {L}}_m\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="normal">L</mi> <mi>m</mi> </msub> </math></EquationSource> </InlineEquation>, which implies that all canonical subframe logics containing <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11225_2025_10207_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="24" /> </InlineMediaObject> <EquationSource Format="TEX">\({\textsc {L}}_m\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="normal">L</mi> <mi>m</mi> </msub> </math></EquationSource> </InlineEquation> have the finite model property.</p>

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

Two Types of Filtrations for \({\textsc {wK4}}\) and Its Relatives

  • Andrey Kudinov,
  • Ilya Shapirovsky

摘要

We study the finite model property of subframe logics with expressible transitive reflexive closure modality. For \(m>0\) m > 0 , let \({\textsc {L}}_m\) L m be the logic defined by axiom \(\lozenge ^{m+1} p\rightarrow \lozenge p\vee p\) m + 1 p p p . We construct quotient filtrations for the logics \({\textsc {L}}_m\) L m , which implies that these logics and their tense counterparts have the finite model property. Then, we construct selective filtrations of the canonical models of \({\textsc {L}}_m\) L m , which implies that all canonical subframe logics containing \({\textsc {L}}_m\) L m have the finite model property.