Help, using Truth Table prove that the following logic statement is a Tautology


by Tek1Atom
Tags: engineering, logic, philosophy, tautology, truth table
Tek1Atom
Tek1Atom is offline
#1
Aug30-10, 01:15 PM
P: 15
1. The problem statement, all variables and given/known data

By providing a truth table, show that the following logic statement is a tautology:

p ∧ (p → q) → q


Any help will be much appreciated.

Thank You
Phys.Org News Partner Science news on Phys.org
Better thermal-imaging lens from waste sulfur
Hackathon team's GoogolPlex gives Siri extra powers
Bright points in Sun's atmosphere mark patterns deep in its interior
Mark44
Mark44 is offline
#2
Aug30-10, 02:19 PM
Mentor
P: 20,962
I would set up a truth table with columns for p, q, and p ==> q. You know how many rows you need, right?
Tek1Atom
Tek1Atom is offline
#3
Aug30-10, 07:36 PM
P: 15
p | q | P → q
-------------
T | T | T
T | F | F
F | T | T
F | F | T

Thank you Mark44 but I don't think this is the correct answer/method as the output has to be true in all cases in order for it to be labeled a tautology. Any other suggestions?

D H
D H is offline
#4
Aug30-10, 07:48 PM
Mentor
P: 14,433

Help, using Truth Table prove that the following logic statement is a Tautology


You are missing at least one column, multiple columns if you want to break things down.
Tek1Atom
Tek1Atom is offline
#5
Aug30-10, 07:51 PM
P: 15
D H could you give me an example please as I am new to logic...
D H
D H is offline
#6
Aug30-10, 08:10 PM
Mentor
P: 14,433
You have the truth table for implication. p→q obviously is not a tautology. You weren't asked to show that. You were asked to show that p∧(p→q)→q is a tautology. Your truth table needs to end with a p∧(p→q)→q column on the right and with all four values in this column being T.
Tek1Atom
Tek1Atom is offline
#7
Aug31-10, 04:09 PM
P: 15
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
D H
D H is offline
#8
Aug31-10, 05:11 PM
Mentor
P: 14,433
You aren't going to get points for that. At least I hope you aren't. There is a thing called showing your work.
Mark44
Mark44 is offline
#9
Aug31-10, 06:05 PM
Mentor
P: 20,962
Quote Quote by Tek1Atom View Post
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
To answer your question about the order, it doesn't really matter, but these are usually presented with the top row being T T ... and the bottom row being F F ...
Tek1Atom
Tek1Atom is offline
#10
Aug31-10, 06:08 PM
P: 15
Thank You Mark44. You have been great!


Register to reply

Related Discussions
Truth table and proving a tautology Precalculus Mathematics Homework 3
Logic/ truth table Precalculus Mathematics Homework 1
Simplifying a logical equivalence statement without a truth table Precalculus Mathematics Homework 1
Logic Truth Table Set Theory, Logic, Probability, Statistics 1
Show that the conditional statement is a Tautology without using truth tables... Precalculus Mathematics Homework 1