© 1996-2015

3 State Propositional Logic

A state is a mapping State from the set of propositional variables V arb to the set of Boolean values Bool  ^= {tt,ff} .

tt  is the semantic ‘true’ value and ff  the semantic ‘false’ value.

State : Varb → Bool

We will use σ0,σ1, σ2,... to denote states and Σ to denote the set of all possible states.

Example 2 Let σ0  be a state such that

σ0(p) = tt
σ0(q) = ff