Math 2.0

Mathematical logic and foundations Definition

Kripke semantics

Builds on Modal logicBinary relationPower set

Definition

A Kripke frame is a pair (W,R)(W, R) of a nonempty set WW of worlds and a binary relation RR on WW, the accessibility relation. A Kripke model is a triple 𝔐=(W,R,V)\mathfrak{M} = (W, R, V) where VV maps each propositional variable to a subset of WW, an element of the power set. Truth of a modal formula at a world w∈Ww \in W is defined by induction.

  1. 𝔐,w⊨p\mathfrak{M}, w \models p if and only if w∈V(p)w \in V(p), and 𝔐,w⊭βŠ₯\mathfrak{M}, w \not\models \bot.
  2. The connectives Β¬\neg, ∧\land, ∨\lor and β†’\to are evaluated at ww as in classical logic.
  3. 𝔐,wβŠ¨β–‘Ο†\mathfrak{M}, w \models \square\varphi if and only if 𝔐,vβŠ¨Ο†\mathfrak{M}, v \models \varphi for every v∈Wv \in W with wRvw R v.

A formula is valid on the frame (W,R)(W, R) when it is true at every world of every model (W,R,V)(W, R, V).

Remarks

Then 𝔐,wβŠ¨β—ŠΟ†\mathfrak{M}, w \models \lozenge\varphi if and only if some vv with wRvw R v has 𝔐,vβŠ¨Ο†\mathfrak{M}, v \models \varphi.

Example: on any frame, the axiom ░(p→q)→(░p→░q)\square(p \to q) \to (\square p \to \square q) is valid. At a world ww where ░(p→q)\square(p \to q) and ░p\square p hold, every vv with wRvw R v satisfies p→qp \to q and pp, hence qq.

Non-example: β–‘pβ†’p\square p \to p is not valid on the frame ({w},βˆ…)(\set{w}, \emptyset). With V(p)=βˆ…V(p) = \emptyset, the formula β–‘p\square p holds at ww because no world is accessible, while pp fails at ww.

The formulas valid on all frames form the logic K\mathrm{K}. The formulas valid on all reflexive frames form T\mathrm{T}, and those valid on all reflexive and transitive frames form S4\mathrm{S4}.

For intuitionistic logic, the relation is a preorder, V(p)V(p) is closed upward, and Ο†β†’Οˆ\varphi \to \psi holds at ww when ψ\psi holds at every vβ‰₯wv \ge w where Ο†\varphi holds.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Binary relation concept
  2. Modal logic concept
  3. Power set concept
  4. Kripke semantics definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Kripke_semantics
About this page
Tag6BQ71KQ6QT
URIm2://6BQ71KQ6QT
Kinddefinition
WritingW0 stub
MSC03B45, 03B20
DefinesKripke semantics
UsesModal logic, Binary relation, Power set
Changed2 November 2026

Markdown Β· JSON Β· Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.