Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
sav08:propositional_logic_syntax [2008/03/10 16:32] vkuncak |
sav08:propositional_logic_syntax [2008/03/11 14:36] vkuncak |
||
---|---|---|---|
Line 38: | Line 38: | ||
\[\begin{array}{l} | \[\begin{array}{l} | ||
FV(p) = \{ p \}, \mbox{ for } p \in V \\ | FV(p) = \{ p \}, \mbox{ for } p \in V \\ | ||
+ | FV(\lnot F) = FV(F) \\ | ||
FV(F_1 \land F_2) = FV(F_1) \cup FV(F_2) \\ | FV(F_1 \land F_2) = FV(F_1) \cup FV(F_2) \\ | ||
FV(F_1 \lor F_2) = FV(F_1) \cup FV(F_2) \\ | FV(F_1 \lor F_2) = FV(F_1) \cup FV(F_2) \\ | ||
- | FV(\lnot F) = FV(F) \\ | ||
FV(F_1 \rightarrow F_2) = FV(F_1) \cup FV(F_2) \\ | FV(F_1 \rightarrow F_2) = FV(F_1) \cup FV(F_2) \\ | ||
FV(F_1 \leftrightarrow F_2) = FV(F_1) \cup FV(F_2) \\ | FV(F_1 \leftrightarrow F_2) = FV(F_1) \cup FV(F_2) \\ | ||
\end{array}\] | \end{array}\] | ||
+ | If $FV(F) = \emptyset$, we call $F$ a //ground formula//. |