Propositional Logic - Conjunction
In natural language a conjunction is equivalent to the conjunction ‘and’. This is going to lead us with the following condition:
$ v(P∧Q)=T iff v(P)=T and v(Q)=T $
Figure 2
Here figure 2 shows that it must be true that both P and Q
are true for the wff ‘P and Q’ to be true. The associated truth table can be
constructed as follows:
Q |
P∧Q |
|
T |
|
|
T |
|
|
F |
|
F |
F |
|
F |
Table 4
Comments
Post a Comment