Logic for Computer Scientists/Modal Logic/Syntax

From testwiki
Revision as of 15:10, 13 July 2009 by imported>Adrignola (+category)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Syntax

We assume the syntax of classical propositional logic as used in the chapters above. Additional we have the following two rules: If A is a formula

A andA

are formulae.

The symbols and stand traditionally for possibility and necessity; in the context of temporal logic they stand for always and eventually, so that A stands for A is eventually true and A for A is always true.

Template:BookCat