<p>In this note I present a Lindström theorem characterizing the hybrid logic <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11225_2025_10172_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {H}(\exists )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">H</mi> <mo stretchy="false">(</mo> <mo>∃</mo> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> as the most expressive logic having compactness, the Tarski union property, and invariance under <i>quasi</i>-generated substructures. The logic <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11225_2025_10172_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {H}(\exists )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">H</mi> <mo stretchy="false">(</mo> <mo>∃</mo> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is rather interesting, as it mixes the expressive power brought by the availability of world variables with an “almost local” quantification, which gives it a counting ability. However, <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11225_2025_10172_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {H}(\exists )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">H</mi> <mo stretchy="false">(</mo> <mo>∃</mo> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> did not receive the same attention as the other logics in the hybrid family, and only quite recently bisimulation-related invariance results were obtained for it. The Lindström theorem presented here helps clarify further its characteristics and situate better its place among extensions. The result is based on a characterization of first-order logic obtained by Lindström and employs a strategy different from the one used in recent Lindström theorems for modal and intuitionistic logics, which require a characterization of the logic at issue with respect to some invariance notion derived from bisimulation. For <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11225_2025_10172_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {H}(\exists )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">H</mi> <mo stretchy="false">(</mo> <mo>∃</mo> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> the strategy used in this note arguably provides a better Lindström theorem, as the invariance notion used gives a clearer perspective on the distinguishing capacities of the competing logics.</p>

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

A Lindström Theorem for the Hybrid Logic \(\mathcal {H}(\exists )\)

  • Diego Pinheiro Fernandes

摘要

In this note I present a Lindström theorem characterizing the hybrid logic \(\mathcal {H}(\exists )\) H ( ) as the most expressive logic having compactness, the Tarski union property, and invariance under quasi-generated substructures. The logic \(\mathcal {H}(\exists )\) H ( ) is rather interesting, as it mixes the expressive power brought by the availability of world variables with an “almost local” quantification, which gives it a counting ability. However, \(\mathcal {H}(\exists )\) H ( ) did not receive the same attention as the other logics in the hybrid family, and only quite recently bisimulation-related invariance results were obtained for it. The Lindström theorem presented here helps clarify further its characteristics and situate better its place among extensions. The result is based on a characterization of first-order logic obtained by Lindström and employs a strategy different from the one used in recent Lindström theorems for modal and intuitionistic logics, which require a characterization of the logic at issue with respect to some invariance notion derived from bisimulation. For \(\mathcal {H}(\exists )\) H ( ) the strategy used in this note arguably provides a better Lindström theorem, as the invariance notion used gives a clearer perspective on the distinguishing capacities of the competing logics.