Difference between revisions of "Modal Logic"
From Wiki Notes @ WuJiewen.com, by Jiewen Wu
(→Syntax) |
|||
| Line 2: | Line 2: | ||
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 | 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\mid\neg\phi\mid\phi\wedge\phi\mid\Box\phi</math> | + | <math>\phi := p\mid\perp\mid\neg\phi\mid\phi\wedge\phi\mid\Box\phi</math> |
==Semantics== | ==Semantics== | ||
Revision as of 13:22, 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\mid\perp\mid\neg\phi\mid\phi\wedge\phi\mid\Box\phi</math>
