Discrete Mathematics Section 1 || Logics page-1

Discrete Mathematics Section 1

1. A compound proposition that is always ___________ is called a tautology.

A.	True
B.	False

Answer: A

Details:

True Explanation: Tautology is always true.

A compound proposition that is always ___________ is called a contradiction.

A.	False
B.	True

Answer: A

Details:

False

A compound proposition that is neither a tautology nor a contradiction is called a ___________

A.	Inference
B.	Condition
C.	Equivalence
D.	Contingency

Answer: D

Details:

Contingency
Contingency: A Contingency is a formula which has both some true and some false values for every value of its propositional variables.
Tautologies: A Tautology is a formula which is always true for every value of its propositional variables.
Contradictions: A Contradiction is a formula which is always false for every value of its propositional variables.

Quick Links

Computer Fundamentals
Operating System
C Programming
C++ Programming

Computer Science

General Knowledge

Notes and Books

Online Test

Past Papers

Discrete Mathematics Section 1

1. A compound proposition that is always ___________ is called a tautology.

A compound proposition that is always ___________ is called a contradiction.

A compound proposition that is neither a tautology nor a contradiction is called a ___________

Quick Links