This question regards the notion of "Tautology". i. Using truth tables, or in any other way, prove th compound propositions is a tautology. These implications are four of the most importan propositional logic. Each rule gives a conclusior from a set of hypotheses. As such, these rules a a correct proof. a. [(P ⇒ Q) ^ P] ⇒ Q. b. [(P⇒ Q) ^ (~ Q)] ⇒ (~ P). E c. [(P⇒ Q) ^ (Q ⇒ R)] ⇒ (P ⇒ R). d. [(P VQ) ^ (~ P)] ⇒ Q.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
This question regards the notion of 'Tautology'.
i. Using truth tables, or in any other way, prove that each of the following
compound propositions is a tautology.
These implications are four of the most important "rules of inference " in
propositional logic. Each rule gives a conclusion which follows logically
from a set of hypotheses. As such, these rules are the building blocks of
a correct proof.
a. [(P ⇒ Q) ^ P] ⇒ Q.
b. [(P ⇒ Q) ^ (~ Q)] ⇒ (~ P).
c. [(P ⇒ Q) ^ (Q ⇒ R)] ⇒ (P ⇒ R).
d. [(PVQ) ^ (~ P)] ⇒ Q.
ii. For each one of the rules of inference in part (i) of this question give an
example of a "real life" situation in which the rule can be applied.
Example: Consider the following two statements:
"If there was no pop-quiz last Tuesday then there will be a pop-quiz
next Tuesday".
"There was no pop-quiz last Tuesday".
Assuming both of these statements to be true, I can apply the tautology
in (a) to deduce that "there will be a pop-quiz next Tuesday".
(Who are P and Q in my example? How was the tautology applied?
Make sure to shortly answer these questions when you provide your own
examples).
Transcribed Image Text:This question regards the notion of 'Tautology'. i. Using truth tables, or in any other way, prove that each of the following compound propositions is a tautology. These implications are four of the most important "rules of inference " in propositional logic. Each rule gives a conclusion which follows logically from a set of hypotheses. As such, these rules are the building blocks of a correct proof. a. [(P ⇒ Q) ^ P] ⇒ Q. b. [(P ⇒ Q) ^ (~ Q)] ⇒ (~ P). c. [(P ⇒ Q) ^ (Q ⇒ R)] ⇒ (P ⇒ R). d. [(PVQ) ^ (~ P)] ⇒ Q. ii. For each one of the rules of inference in part (i) of this question give an example of a "real life" situation in which the rule can be applied. Example: Consider the following two statements: "If there was no pop-quiz last Tuesday then there will be a pop-quiz next Tuesday". "There was no pop-quiz last Tuesday". Assuming both of these statements to be true, I can apply the tautology in (a) to deduce that "there will be a pop-quiz next Tuesday". (Who are P and Q in my example? How was the tautology applied? Make sure to shortly answer these questions when you provide your own examples).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 6 steps with 4 images

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Can you be so kind as to give a hand with the second part of this problem  -  ii) ?

Thanks

This question regards the notion of 'Tautology'.
i. Using truth tables, or in any other way, prove that each of the following
compound propositions is a tautology.
These implications are four of the most important "rules of inference " in
propositional logic. Each rule gives a conclusion which follows logically
from a set of hypotheses. As such, these rules are the building blocks of
a correct proof.
a. [(P ⇒ Q) ^ P] ⇒ Q.
b. [(P ⇒ Q) ^ (~ Q)] ⇒ (~ P).
c. [(P ⇒ Q) ^ (Q ⇒ R)] ⇒ (P ⇒ R).
d. [(PVQ) ^ (~ P)] ⇒ Q.
ii. For each one of the rules of inference in part (i) of this question give an
example of a "real life" situation in which the rule can be applied.
Example: Consider the following two statements:
"If there was no pop-quiz last Tuesday then there will be a pop-quiz
next Tuesday".
"There was no pop-quiz last Tuesday".
Assuming both of these statements to be true, I can apply the tautology
in (a) to deduce that "there will be a pop-quiz next Tuesday".
(Who are P and Q in my example? How was the tautology applied?
Make sure to shortly answer these questions when you provide your own
examples).
Transcribed Image Text:This question regards the notion of 'Tautology'. i. Using truth tables, or in any other way, prove that each of the following compound propositions is a tautology. These implications are four of the most important "rules of inference " in propositional logic. Each rule gives a conclusion which follows logically from a set of hypotheses. As such, these rules are the building blocks of a correct proof. a. [(P ⇒ Q) ^ P] ⇒ Q. b. [(P ⇒ Q) ^ (~ Q)] ⇒ (~ P). c. [(P ⇒ Q) ^ (Q ⇒ R)] ⇒ (P ⇒ R). d. [(PVQ) ^ (~ P)] ⇒ Q. ii. For each one of the rules of inference in part (i) of this question give an example of a "real life" situation in which the rule can be applied. Example: Consider the following two statements: "If there was no pop-quiz last Tuesday then there will be a pop-quiz next Tuesday". "There was no pop-quiz last Tuesday". Assuming both of these statements to be true, I can apply the tautology in (a) to deduce that "there will be a pop-quiz next Tuesday". (Who are P and Q in my example? How was the tautology applied? Make sure to shortly answer these questions when you provide your own examples).
Solution
Bartleby Expert
SEE SOLUTION
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,