Difference between revisions of "Modal Logic"
From Wiki Notes @ WuJiewen.com, by Jiewen Wu
(New page: ==Syntax== ==Semantics==) |
(→Syntax) |
||
| Line 1: | Line 1: | ||
==Syntax== | ==Syntax== | ||
| + | The basic modal logic is defined using a set of propositional letters <math>\,\Phi</math>, and a unary operator <math>\,\Box</math>. A well-formed formula is then given by the rule | ||
| + | <math>\phi := p\perp\neg\phi\perp\phi\wedge\phi\perp\Box\phi</math> | ||
==Semantics== | ==Semantics== | ||
Revision as of 13:21, 5 November 2009
Syntax
The basic modal logic is defined using a set of propositional letters <math>\,\Phi</math>, and a unary operator <math>\,\Box</math>. A well-formed formula is then given by the rule
<math>\phi := p\perp\neg\phi\perp\phi\wedge\phi\perp\Box\phi</math>
