Content deleted Content added
MOS:SECTIONORDER |
|||
Line 25:
On the other hand, the rules of the given program can be viewed as [[propositional formula]]s if we identify the comma with conjunction <math>\land</math>, the symbol <math>\operatorname{not}</math> with negation <math>\neg</math>, and agree to treat <math>F \leftarrow G</math> as the implication <math>G \rightarrow F</math> written backwards. For instance, the last rule of the given program is, from this point of view, alternative notation for the propositional formula
:<math>p \land not\
If we calculate the [[truth value]]s of the rules of the program for the truth assignment shown above then we will see that each rule gets the value '''T'''. In other words, that assignment is a [[model theory|model]] of the program. But this program has also other models, for instance
| |||