Lably
Skip to content

Modal operator

  • 2 min read
  • 2 chapters

Related on Lably

Through Logical connective, Proposition and Belief

Syntax for modal operators

The syntax rules for modal operators ◻ and ◊ are very similar to those for universal and existential quantifiers; In fact, any formula with modal operators ◻ and ◊, and the usual logical connectives in propositional calculus (∧,∨,¬,→,↔) can be rewritten to a de dicto normal form, similar to prenex normal form. One major caveat: Whereas the universal and existential quantifiers only binds to the propositional variables or the predicate variables following the quantifiers, since the modal operators ◻ and ◊ quantifies over accessible possible worlds, they will bind to any formula in their scope. For example, (∃x(x2=1))∧(0=y) is logically equivalent to ∃x(x2=1∧0=y), but (◊(x2=1))∧(0=y) is not logically equivalent to ◊(x2=1∧0=y); Instead, ◊(x2=1∧0=y) is logically equivalent to (◊(x2=1))∧◊(0=y).

When there are both modal operators and quantifiers in a formula, different order of an adjacent pair of modal operator and quantifier can lead to different semantic meanings; Also, when multimodal logic is involved, different order of an adjacent pair of modal operators can also lead to different semantic meanings.

Sign in to keep reading

One more chapter is free with a Lably account.

More in Language and linguistics