Теория пропозициональных программ ii.

Аннотация

Every action results in some state. If in a current state we have the goal state description, then we are in position to cope with the wanted minimal changes of current state allowing us to realize given transition.

From the logical point of view it is completely irrelevant in details and means how that transition will be done. Just the possibility of transition is counted.

In this way we arrive at construction of dynamic logic because of describing goal states and not the sequences of actions leading to those states. Very naturally we assign some accessibility relation on the set of states to an every formula of language. In case of propositional logic the states would be the truth-value assignments to propositional variables.