1. Using a truth table, show whether the following wffs are tautologies. Be sure to state your justification for your conclusion. a. (pvq)^(p-r) b. (ba)-((¬b→a)→b)

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
Can anyone please help me with questions 1,2,3,4 and 5 ? I’m stuck on them!
Wednesday, 3/1/2023. The assessment will be closed book and closed note.
1. Using a truth table, show whether the following wffs are tautologies. Be sure to state your
justification for your conclusion.
a. (pvq)^(p-r)
b. (ba)-((¬b→a)→b)
2. Using a truth table, show whether the following wffs are satisfiable. Be sure to state your
justification for your conclusion and list the truth sets, if applicable.
a. (p→q) ^ (q→p)
b. ((p^q) ^r) ^¬r
c. ((p^q) vr) v¬r
3. Using a truth table, show which of the following sets of formula are satisfiable. Be sure to state
your justification for your conclusion.
a. {((p^q) ^r), (pv q),¬p}
b.
{(p→q), p. q}
c. {p.(q-p),(-q V p)}
4. Prove the following by mathematical induction.
n(n + 1)(2n + 1)
Σ2²: 6
1=1
5. Prove the following by mathematical induction: n! > 2" for all integers n ≥ 4.
Transcribed Image Text:Wednesday, 3/1/2023. The assessment will be closed book and closed note. 1. Using a truth table, show whether the following wffs are tautologies. Be sure to state your justification for your conclusion. a. (pvq)^(p-r) b. (ba)-((¬b→a)→b) 2. Using a truth table, show whether the following wffs are satisfiable. Be sure to state your justification for your conclusion and list the truth sets, if applicable. a. (p→q) ^ (q→p) b. ((p^q) ^r) ^¬r c. ((p^q) vr) v¬r 3. Using a truth table, show which of the following sets of formula are satisfiable. Be sure to state your justification for your conclusion. a. {((p^q) ^r), (pv q),¬p} b. {(p→q), p. q} c. {p.(q-p),(-q V p)} 4. Prove the following by mathematical induction. n(n + 1)(2n + 1) Σ2²: 6 1=1 5. Prove the following by mathematical induction: n! > 2" for all integers n ≥ 4.
book and closed note.
1. Using a truth table, show whether the following wffs are tautologies. Be sure to state your
justification for your conclusion.
a. (pv q) ^ (por)
b. (ba)-((-b→a)→b)
2. Using a truth table, show whether the following wffs are satisfiable. Be sure to state your
justification for your conclusion and list the truth sets, if applicable.
a. (p→q) ^ (q→p)
b. ((p^q)^r) A-r
c. ((p^q) vr) V¬r
3. Using a truth table, show which of the following sets of formula are satisfiable. Be sure to state
your justification for your conclusion.
a. {((p^q) ^r), (pv q),¬p}
b. {(p→q),¬p,¬q}
c. {p,(q→p),(-q V p)}
4. Prove the following by mathematical induction.
n
n(n+1)(2n + 1)
6
5. Prove the following by mathematical induction: n! > 2" for all integers n ≥ 4.
i=1
Transcribed Image Text:book and closed note. 1. Using a truth table, show whether the following wffs are tautologies. Be sure to state your justification for your conclusion. a. (pv q) ^ (por) b. (ba)-((-b→a)→b) 2. Using a truth table, show whether the following wffs are satisfiable. Be sure to state your justification for your conclusion and list the truth sets, if applicable. a. (p→q) ^ (q→p) b. ((p^q)^r) A-r c. ((p^q) vr) V¬r 3. Using a truth table, show which of the following sets of formula are satisfiable. Be sure to state your justification for your conclusion. a. {((p^q) ^r), (pv q),¬p} b. {(p→q),¬p,¬q} c. {p,(q→p),(-q V p)} 4. Prove the following by mathematical induction. n n(n+1)(2n + 1) 6 5. Prove the following by mathematical induction: n! > 2" for all integers n ≥ 4. i=1
Expert Solution
Step 1

Advanced Math homework question answer, step 1, image 1

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
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,