Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Yay! Propositional logic proofs! [ 1 6 points ] Note that you may not use methods such as proof by contradiction, and may only use

Yay! Propositional logic proofs! [16 points]
Note that you may not use methods such as proof by contradiction, and may only use proof methods you have
learned up to this point.
(a) Provide a formal proof for ((PQ)P)P. Note that this is a tautology because it is true without any
givens. This is known as Peirce's law, and holds philosophical significance in the theory of logic. [4 points]
(b) Provide a formal proof for PvvnotP (known as the "law of the excluded middle"). This is also a tautology. You
may not use the Law of the Excluded Middle. [4 points]
(c) Given A(BvvC) and BnotA, provide a formal proof that notAvvC. [4 points]
(d) Given PnotR,(QvvR)??(RvvS), and Q((RvvS)V), it follows that PV.[4 points]
Note: Your proof for part d is only allowed to use the rules the Modus Ponens, Direct Proof, Intro ???,Elim????,
Intro vv, Elim vv. Note that Equivalent is not allowed this time. (Hint: Elim vv will be useful!)
image text in transcribed

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Concepts

Authors: David M. Kroenke

1st Edition

0130086509, 978-0130086501

More Books

Students also viewed these Databases questions