Tek1Atom
- 15
- 0
Homework Statement
By providing a truth table, show that the following logic statement is a tautology:
p ∧ (p → q) → qAny help will be much appreciated.
Thank You
The discussion revolves around the task of proving that the logic statement p ∧ (p → q) → q is a tautology using a truth table. Participants are exploring how to correctly set up the truth table and what constitutes a tautology in this context.
Participants express differing views on the completeness of the truth table setup and the importance of showing work. There is no consensus on the best way to present the truth table, and the discussion remains unresolved regarding the most effective approach to demonstrate the statement as a tautology.
Some participants highlight the need for additional columns in the truth table, indicating that assumptions about the structure of the truth table may be missing. There is also a focus on the requirement that all values in the final column must be true for the statement to be classified as a tautology.
Tek1Atom said:Thank you DH, that was very helpful. My final question is, does it matter which way we write down the truth table?
e.g.
which one is correct?
p | q | P → q | p∧(p→q)→q
---------------------------
T | T | T | T
T | F | F | T
F | T | T | T
F | F | T | T
OR
p | q | P → q | p∧(p→q)→q
---------------------------
F | F | T | T
F | T | T | T
T | F | F | T
T | T | T | T