When to proof P→Q true, we proof P false, that type of proof is known as                        

Related MCQs

• A proof that p → q is true based on the fact that q is true, such proofs are known as
• Suppose that P(n) is a propositional function. Determine for which positive integers n the statement P(n) must be true if: P(1) is true; for all positive integers n, if P(n) is true then P(n+2) is true.
• Suppose that P(n) is a propositional function. Determine for which positive integers n the statement P(n) must be true if: P(1) and P(2) is true; for all positive integers n, if P(n) and P(n+1) is true then P(n+2) is true.
• A proof covering all the possible cases, such type of proofs are known as
• Let P: If Sahil bowls, Saurabh hits a century.; Q: If Raju bowls, Sahil gets out on first ball. Now if P is true and Q is false then which of the following can be true?
• Let P: If Sahil bowls, Saurabh hits a century.; Q: If Raju bowls, Sahil gets out on first ball. Now if P is true and Q is false then which of the following can be true?
• In proving √5 as irrational, we begin with assumption √5 is rational in which type of proof?
• A proof broken into distinct cases, where these cases cover all prospects, such proofs are known as                        
• If in the truth table the answer column has the truth values both TRUE and FALSE then it is said to be ________.
• Let the statement be “If n is not an odd integer then square of n is not odd.”, then if P(n) is “n is an not an odd integer” and Q(n) is “(square of n) is not odd.” For direct proof we should prove