27.01.2014 Views

Multiagent Systems

Multiagent Systems

Multiagent Systems

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Prof. Dr. Jürgen Dix · Department of Informatics, TUC <strong>Multiagent</strong> <strong>Systems</strong>, WS 06/07 484/731<br />

7. Modal Logic 2. Kripke Semantics<br />

Definition 7.4 (Modal Logic with n modalities)<br />

The language L modaln of modal logic with n<br />

modal operators □ 1 , . . . , □ n is the smallest set<br />

containing the propositional constants of L, and<br />

with formulae φ, ψ also the formulae<br />

□ i φ, ¬φ, φ ∧ ψ. We treat ∨, →, ↔, ♦ as macros<br />

(defined as usual).<br />

Note that the □ operators can be nested:<br />

(□ 1 □ 2 □ 1 p) ∨ □ 3 ¬p

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!