<p>In this paper, we investigate dynamic modal logics with global and local dynamic operations, which update the accessibility relation of a graph model. We introduce the hybrid logic <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\textsf{GLV}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="sans-serif">GLV</mi> </math></EquationSource> </InlineEquation> of global link variations, which involves dynamic operators of global link cutting, adding and rotating simultaneously. We provide the Hilbert-style calculus <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathsf {C_{GLV}}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="sans-serif">C</mi> <mi mathvariant="sans-serif">GLV</mi> </msub> </math></EquationSource> </InlineEquation> and prove that it is sound and strongly complete with respect to <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\textsf{GLV}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="sans-serif">GLV</mi> </math></EquationSource> </InlineEquation> by constructing a family of canonical models inductively. We study the hybrid extensions of the logic <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\textsf{LLD}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="sans-serif">LLD</mi> </math></EquationSource> </InlineEquation> of definable link deletion introduced by Li (<CitationRef CitationID="CR12">2020</CitationRef>). We provide a sound and complete tableau calculus <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\mathcal {T}(\textsf{LLD}(@))\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">T</mi> <mo stretchy="false">(</mo> <mi mathvariant="sans-serif">LLD</mi> <mo stretchy="false">(</mo> <mo>@</mo> <mo stretchy="false">)</mo> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> for the logic <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\textsf{LLD}(@)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="sans-serif">LLD</mi> <mo stretchy="false">(</mo> <mo>@</mo> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. Then we extend <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\textsf{LLD}(@)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="sans-serif">LLD</mi> <mo stretchy="false">(</mo> <mo>@</mo> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> to the logics <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\textsf{LLV}(@,X)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="sans-serif">LLV</mi> <mo stretchy="false">(</mo> <mo>@</mo> <mo>,</mo> <mi>X</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> of local link variations and provide them with sound and complete tableau calculi. Furthermore, we extend the logic <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\textsf{LLV}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="sans-serif">LLV</mi> </math></EquationSource> </InlineEquation> to <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\textsf{LLV}(\downarrow \hspace{-.3em}\, ,\textsf{E})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="sans-serif">LLV</mi> <mo stretchy="false">(</mo> <mo stretchy="false">↓</mo> <mspace width="-3.00003pt" /> <mspace width="0.166667em" /> <mo>,</mo> <mi mathvariant="sans-serif">E</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> by adding the hybrid operator <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(\downarrow \hspace{-.3em}a.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">↓</mo> <mspace width="-3.00003pt" /> <mi>a</mi> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> and existential modality <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(\textsf{E}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="sans-serif">E</mi> </math></EquationSource> </InlineEquation>. By defining local named dynamic operators and providing recursion axioms for them, we obtain a sound and strongly complete calculus <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(\mathsf {C_{LLV}}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="sans-serif">C</mi> <mi mathvariant="sans-serif">LLV</mi> </msub> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(\textsf{LLV}(\downarrow \hspace{-.3em}\, ,\textsf{E})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="sans-serif">LLV</mi> <mo stretchy="false">(</mo> <mo stretchy="false">↓</mo> <mspace width="-3.00003pt" /> <mspace width="0.166667em" /> <mo>,</mo> <mi mathvariant="sans-serif">E</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. Finally, we show that for any set <i>X</i> of global or local operators, the calculus <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(\mathsf {C_{GLV}}(X)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="sans-serif">C</mi> <mi mathvariant="sans-serif">GLV</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>X</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(\mathsf {C_{LLV}}(X)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="sans-serif">C</mi> <mi mathvariant="sans-serif">LLV</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>X</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> are still sound and strongly complete w.r.t the logic <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\(\textsf{GLV}(X)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="sans-serif">GLV</mi> <mo stretchy="false">(</mo> <mi>X</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq18"> <EquationSource Format="TEX">\(\textsf{LLV}(\downarrow \hspace{-.3em}\, ,\textsf{E},X)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="sans-serif">LLV</mi> <mo stretchy="false">(</mo> <mo stretchy="false">↓</mo> <mspace width="-3.00003pt" /> <mspace width="0.166667em" /> <mo>,</mo> <mi mathvariant="sans-serif">E</mi> <mo>,</mo> <mi>X</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, respectively.</p>

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

Hilbert-Style Calculus and Tableau Calculus for Logics of Link Variations

  • Penghao Du,
  • Qian Chen

摘要

In this paper, we investigate dynamic modal logics with global and local dynamic operations, which update the accessibility relation of a graph model. We introduce the hybrid logic \(\textsf{GLV}\) GLV of global link variations, which involves dynamic operators of global link cutting, adding and rotating simultaneously. We provide the Hilbert-style calculus \(\mathsf {C_{GLV}}\) C GLV and prove that it is sound and strongly complete with respect to \(\textsf{GLV}\) GLV by constructing a family of canonical models inductively. We study the hybrid extensions of the logic \(\textsf{LLD}\) LLD of definable link deletion introduced by Li (2020). We provide a sound and complete tableau calculus \(\mathcal {T}(\textsf{LLD}(@))\) T ( LLD ( @ ) ) for the logic \(\textsf{LLD}(@)\) LLD ( @ ) . Then we extend \(\textsf{LLD}(@)\) LLD ( @ ) to the logics \(\textsf{LLV}(@,X)\) LLV ( @ , X ) of local link variations and provide them with sound and complete tableau calculi. Furthermore, we extend the logic \(\textsf{LLV}\) LLV to \(\textsf{LLV}(\downarrow \hspace{-.3em}\, ,\textsf{E})\) LLV ( , E ) by adding the hybrid operator \(\downarrow \hspace{-.3em}a.\) a . and existential modality \(\textsf{E}\) E . By defining local named dynamic operators and providing recursion axioms for them, we obtain a sound and strongly complete calculus \(\mathsf {C_{LLV}}\) C LLV for \(\textsf{LLV}(\downarrow \hspace{-.3em}\, ,\textsf{E})\) LLV ( , E ) . Finally, we show that for any set X of global or local operators, the calculus \(\mathsf {C_{GLV}}(X)\) C GLV ( X ) and \(\mathsf {C_{LLV}}(X)\) C LLV ( X ) are still sound and strongly complete w.r.t the logic \(\textsf{GLV}(X)\) GLV ( X ) and \(\textsf{LLV}(\downarrow \hspace{-.3em}\, ,\textsf{E},X)\) LLV ( , E , X ) , respectively.