<p>There is an alternative semantics for multi-modal (epistemic) logics based on (world, agent) pairs (see, e.g., Grove, <i>Artificial Intelligence</i>, <CitationRef CitationID="CR19">1995</CitationRef>). Denote it by <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10849_2025_9434_Article_IEq2.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="65" /> </InlineMediaObject> <EquationSource Format="TEX">\(Sem_{\langle w,a\rangle }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mi>e</mi> <msub> <mi>m</mi> <mrow> <mo stretchy="false">⟨</mo> <mi>w</mi> <mo>,</mo> <mi>a</mi> <mo stretchy="false">⟩</mo> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation>. It is effectively applied to multi-modal logics with <i>quantification over agents of knowledge</i> (or over their names). In this paper, we consider propositional modal logic with <i>quantification over propositions</i> (<InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10849_2025_9434_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="72" /> </InlineMediaObject> <EquationSource Format="TEX">\(SOPML\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="italic">SOPML</mi> </mrow> </math></EquationSource> </InlineEquation>) and introduce an alternative semantics for this logic also based on pairs, but pairs of a slightly different kind, namely, on (world, proposition) pairs. Denote it by <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10849_2025_9434_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="65" /> </InlineMediaObject> <EquationSource Format="TEX">\(Sem_{\langle w,p\rangle }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mi>e</mi> <msub> <mi>m</mi> <mrow> <mo stretchy="false">⟨</mo> <mi>w</mi> <mo>,</mo> <mi>p</mi> <mo stretchy="false">⟩</mo> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation>. Some key properties of <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10849_2025_9434_Article_IEq2.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="65" /> </InlineMediaObject> <EquationSource Format="TEX">\(Sem_{\langle w,a\rangle }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mi>e</mi> <msub> <mi>m</mi> <mrow> <mo stretchy="false">⟨</mo> <mi>w</mi> <mo>,</mo> <mi>a</mi> <mo stretchy="false">⟩</mo> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation>, as well as the principles for constructing this semantics will be taken as a basis to define <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10849_2025_9434_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="65" /> </InlineMediaObject> <EquationSource Format="TEX">\(Sem_{\langle w,p\rangle }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mi>e</mi> <msub> <mi>m</mi> <mrow> <mo stretchy="false">⟨</mo> <mi>w</mi> <mo>,</mo> <mi>p</mi> <mo stretchy="false">⟩</mo> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation>. Within the framework of the introduced semantics, we define general (or Henkin) frames and present a decidable <i>modal two-variable fragment</i> of <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10849_2025_9434_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="72" /> </InlineMediaObject> <EquationSource Format="TEX">\(SOPML\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="italic">SOPML</mi> </mrow> </math></EquationSource> </InlineEquation> interpreted on these frames (<InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10849_2025_9434_Article_IEq8.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="87" /> </InlineMediaObject> <EquationSource Format="TEX">\(SOPML^H_{tvf}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mi>O</mi> <mi>P</mi> <mi>M</mi> <msubsup> <mi>L</mi> <mrow> <mi mathvariant="italic">tvf</mi> </mrow> <mi>H</mi> </msubsup> </mrow> </math></EquationSource> </InlineEquation>). <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10849_2025_9434_Article_IEq8.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="87" /> </InlineMediaObject> <EquationSource Format="TEX">\(SOPML^H_{tvf}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mi>O</mi> <mi>P</mi> <mi>M</mi> <msubsup> <mi>L</mi> <mrow> <mi mathvariant="italic">tvf</mi> </mrow> <mi>H</mi> </msubsup> </mrow> </math></EquationSource> </InlineEquation> allows us to express all challenges considered in (Shtakser <CitationRef CitationID="CR34">2023a</CitationRef>, <i>J.Log.Lang.Inf.</i>,) and inexpressible in a decidable <i>modal loosely guarded fragment</i> of <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10849_2025_9434_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="72" /> </InlineMediaObject> <EquationSource Format="TEX">\(SOPML\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="italic">SOPML</mi> </mrow> </math></EquationSource> </InlineEquation> presented in that paper. The fragment <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10849_2025_9434_Article_IEq8.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="87" /> </InlineMediaObject> <EquationSource Format="TEX">\(SOPML^H_{tvf}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mi>O</mi> <mi>P</mi> <mi>M</mi> <msubsup> <mi>L</mi> <mrow> <mi mathvariant="italic">tvf</mi> </mrow> <mi>H</mi> </msubsup> </mrow> </math></EquationSource> </InlineEquation> partially satisfies the principle of non-Fregean logic: two different <i>atomic</i> propositions with the same truth value can have different contents. Also we define <i>relating connectives</i> in <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10849_2025_9434_Article_IEq8.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="87" /> </InlineMediaObject> <EquationSource Format="TEX">\(SOPML^H_{tvf}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mi>O</mi> <mi>P</mi> <mi>M</mi> <msubsup> <mi>L</mi> <mrow> <mi mathvariant="italic">tvf</mi> </mrow> <mi>H</mi> </msubsup> </mrow> </math></EquationSource> </InlineEquation> and prove that the <i>weak Boethius’ Thesis</i> built using these connectives is a valid formula of this fragment.</p>

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

A Modal Two-Variable Fragment of Second-Order Propositional Modal Logic

  • Gennady Shtakser

摘要

There is an alternative semantics for multi-modal (epistemic) logics based on (world, agent) pairs (see, e.g., Grove, Artificial Intelligence, 1995). Denote it by \(Sem_{\langle w,a\rangle }\) S e m w , a . It is effectively applied to multi-modal logics with quantification over agents of knowledge (or over their names). In this paper, we consider propositional modal logic with quantification over propositions ( \(SOPML\) SOPML ) and introduce an alternative semantics for this logic also based on pairs, but pairs of a slightly different kind, namely, on (world, proposition) pairs. Denote it by \(Sem_{\langle w,p\rangle }\) S e m w , p . Some key properties of \(Sem_{\langle w,a\rangle }\) S e m w , a , as well as the principles for constructing this semantics will be taken as a basis to define \(Sem_{\langle w,p\rangle }\) S e m w , p . Within the framework of the introduced semantics, we define general (or Henkin) frames and present a decidable modal two-variable fragment of \(SOPML\) SOPML interpreted on these frames ( \(SOPML^H_{tvf}\) S O P M L tvf H ). \(SOPML^H_{tvf}\) S O P M L tvf H allows us to express all challenges considered in (Shtakser 2023a, J.Log.Lang.Inf.,) and inexpressible in a decidable modal loosely guarded fragment of \(SOPML\) SOPML presented in that paper. The fragment \(SOPML^H_{tvf}\) S O P M L tvf H partially satisfies the principle of non-Fregean logic: two different atomic propositions with the same truth value can have different contents. Also we define relating connectives in \(SOPML^H_{tvf}\) S O P M L tvf H and prove that the weak Boethius’ Thesis built using these connectives is a valid formula of this fragment.