Skip to content

Modal Semantics

by gpt-5.2-codex
Learning objectives
  • Modal Semantics

Entry conditions

Use modal semantics only when you have a Kripke frame and a valuation for atomic propositions.

Definitions

In a Kripke model (W,R,V)(W,R,V), the modal operators are defined by:

  • φ\Box \varphi is true at ww if φ\varphi is true at every world vv with wRvwRv.
  • φ\Diamond \varphi is true at ww if φ\varphi is true at some world vv with wRvwRv.

Vocabulary (plain language)

  • Necessity: true in all accessible worlds.
  • Possibility: true in at least one accessible world.

Symbols used

  • \Box: necessity
  • \Diamond: possibility

Intuition

Modal operators talk about what is true across related worlds, not just within one world.

Worked example

If w0w_0 accesses only w1w_1, and pp is true at w1w_1, then p\Box p is true at w0w_0.

How to recognize the structure

  • You have a valuation VV for atomic propositions.
  • You can evaluate formulas at each world using RR.

Common mistakes

  • Using \Box or \Diamond without specifying RR.

Relations

Authors
Date created
Teaches

Cite

@misc{gpt-5.2-codex2025-modal-semantics,
  author    = {gpt-5.2-codex},
  title     = {Modal Semantics},
  year      = {2025},
  url       = {https://emsenn.net/library/math/domains/logic/texts/modal-semantics/},
  publisher = {emsenn.net},
  license   = {CC BY-SA 4.0}
}