The modal logic of inequality (Q4032643)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 150000
Language Label Description Also known as
default for all languages
No label defined
    English
    The modal logic of inequality
    scientific article; zbMATH DE number 150000

      Statements

      The modal logic of inequality (English)
      0 references
      0 references
      1 April 1993
      0 references
      functional completeness
      0 references
      \(\omega\)-categoricity
      0 references
      sequential definability
      0 references
      general frame
      0 references
      canonical frame
      0 references
      Kripke-completeness
      0 references
      Sahlqvist formula
      0 references
      \(p\)-relation
      0 references
      ultraproduct
      0 references
      propositional modal logics with \(D\)-operator
      0 references
      Kripke semantics
      0 references
      expressibility
      0 references
      definability
      0 references
      completeness
      0 references
      bimodal language
      0 references
      Kripke models
      0 references
      The paper studies propositional modal logics with \(D\)-operator whose Kripke semantics is given by the condition: \(w \models DA\) iff for some \(v \neq w\), \(v \models A\). The topics considered are: expressibility, definability, completeness. It is proved that on frames the language \({\mathcal L} (D)\) with the single modal operator \(D\) is equivalent to the first-order language with ``=''. The logic \(DL^ -\) of all valid formulas in \({\mathcal L} (D)\) was axiomatized earlier by R. Koymans. Extensions of \(DL^ -\) may be Kripke-incomplete. To avoid this, the following ``irreflexivity rule'' (first introduced by Dov Gabbay) is added: \(p \wedge \neg Dp \to \varphi /\varphi\) (if \(p\) is a proposition letter, non-occurring in \(\varphi)\). The resulting logic \(DL\) is deductively equivalent to \(DL^ -\), and each of its extensions by new axioms is complete. The bimodal language \({\mathcal L} (\diamondsuit,D)\) has also the operator \(\diamondsuit\) which is interpreted in Kripke semantics as usual. \({\mathcal L} (\diamondsuit,D)\) is more expressive than \({\mathcal L} (\diamondsuit)\). In particular, the \({\mathcal L} (\diamondsuit,D)\)-logic of rationals is \(\omega\)-categorical, unlike the \({\mathcal L} (\diamondsuit)\)-logic; in \({\mathcal L} (\diamondsuit,D)\) finite frames may be classified up to an isomorphism, etc. Completeness results proved for logics in this language include characterizations of some classes of frames (e.g. partial orders, strict linear orders) or of some specific frames (naturals, integers, rationals), as well as a general completeness theorem of Sahlqvist-type [cf. \textit{H. Sahlqvist}, Proc. 3rd Scand. Logic Symp., Uppsala 1973, 100- 143 (1975; Zbl 0319.02018)]). The final theorem (motivated by an earlier result of P. Rodenburg's for intuitionistic formulas) gives a characterization of \({\mathcal L} (\diamondsuit,D)\)-definable classes of Kripke models. Misprint: In the proof of 3.12 on p. 577, line 12, the second \(\varphi\) should be replaced by \(\psi\).
      0 references

      Identifiers