Answer:
Step-by-step explanation:
The statement is P forward Q is true and q is true, then p is true sometimes always or never.
That, written using logical symbology, is:
- p → q,
- q is true
- then p is ?
p → q is known as a conditional statement.
When the conditional p → q is true and p is also verified to be true, you must conclude that q is (necessarily) true (else the conditional would be false).
That also means that if q is verified to be false (not true), p must necessarily be false (else the conditional would be false).
Nevertheless, the fact that q is true, does not permit to conclude whether p is true or false: p can be either true or false when you only know that q is true.
Then, you cannot tell that p is true always or never; some times it could be true and others false.