Let B1, B2, , Bn be statement letters. Prove the finite extension of De Morgans laws

Chapter 3, Problem 70

(choose chapter or problem)

Get Unlimited Answers
QUESTION:

Let B1, B2, , Bn be statement letters. Prove the finite extension of De Morgans laws: (B1 ~ B2 ~ c~ Bn) 3 B1 ` B2 ` c` Bn and (B1 ` B2 ` c` Bn) 3 B1 ~ B2 ~ c~ Bn for n 2.

Questions & Answers

QUESTION:

Let B1, B2, , Bn be statement letters. Prove the finite extension of De Morgans laws: (B1 ~ B2 ~ c~ Bn) 3 B1 ` B2 ` c` Bn and (B1 ` B2 ` c` Bn) 3 B1 ~ B2 ~ c~ Bn for n 2.

ANSWER:

Step 1of 2

The recursive definition of the statement definitions can be obtained by using the definition of the disjunction operation of  statement letter for. The finite extension of the De Morgan’s laws can be proved by using mathematical induction.

Add to cart


Study Tools You Might Need

Not The Solution You Need? Search for Your Answer Here:

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back