Def. A compound proposition that is always true, no matter what the truth values of the (simple) propositions that occur in it, is called tautology. A compound proposition that is always false, no matter what, is called a contradiction. A proposition that is neither a tautology nor a contradiction is called a contingency. Q1) Let p be a proposition. Indicate whether the propositions are: (A) tautologies (B) contradictions or (C) contingencies. Proposition pV¬p pA-p X+7 = 18 for every real number x type Q2) Use truth tables to show that --p=p (the double negation law) is valid. Q3) Use truth tables to show that p v (p ^ q) = p _is valid. Q3) Use truth tables to show that p v (q A r) = (p V q) A (p V r) is valid. Q4) Without truth tables to show that ¬ (-p ^ q) =pV ¬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
Topic Video
Question
Def. A compound proposition that is always true, no matter what the truth values of the
(simple) propositions that occur in it, is called tautology. A compound proposition that is
always false, no matter what, is called a contradiction. A proposition that is neither a
tautology nor a contradiction is called a contingency.
Q1) Let p be a proposition. Indicate whether the propositions are: (A) tautologies (B)
contradictions or (C) contingencies.
Proposition
pV-p
p^-p
X +7 = 18 for every real number x
type
Q2) Use truth tables to show that --p=p
(the double negation law) is valid.
Q3) Use truth tables to show that p V (p ^ q) = p is valid.
Q3) Use truth tables to show that p V (q A r) = (p V q) ^ (p V r) is valid.
Q4) Without truth tables to show that ¬
-(-p^q) =p V ¬q
Transcribed Image Text:Def. A compound proposition that is always true, no matter what the truth values of the (simple) propositions that occur in it, is called tautology. A compound proposition that is always false, no matter what, is called a contradiction. A proposition that is neither a tautology nor a contradiction is called a contingency. Q1) Let p be a proposition. Indicate whether the propositions are: (A) tautologies (B) contradictions or (C) contingencies. Proposition pV-p p^-p X +7 = 18 for every real number x type Q2) Use truth tables to show that --p=p (the double negation law) is valid. Q3) Use truth tables to show that p V (p ^ q) = p is valid. Q3) Use truth tables to show that p V (q A r) = (p V q) ^ (p V r) is valid. Q4) Without truth tables to show that ¬ -(-p^q) =p V ¬q
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Propositional Calculus
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE 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,