compound statements and truth table

A statement whose truth can be easily deduced from a theorem is a corollar..

Use of Venn diagrams in Logic - Venn diagrams are used very frequently on problems of set theory. Venn diagrams can also be used for deciding the truthfulness of statements..

Arguments and their Validity - A compound proposition is a tautology if it is always true for all possible combination of the truth values of its components. If a compound proposition which is always false for all possible combination of the truth values, of ..

Two compound propositions p and q are said to be logically equivalent, if their truth values are same for each different combinations of the truth values of the components involved in them. If p and q are logically equivalent, then it is represented by p..

Two propositions (simple or compound) are said to be logically equivalent if they have identical truth values. If p is logically equivalent to q, we denote p q. We have already constructed the truth table of (~p) q in earlier class. Recall the same tr..

Summary - A sentence is called a statement if it can be adjudged as true or false. Every statement is a sentence, but a sentence may or may not be a statement. A statement involving natural number n is generally denoted by P(n). Principle of mathematical induction..

If p and q are two propositions, then the compound proposition "p and q" is known as conjunction of the proposition. It is denoted by [The conjunction of two propositions p and q is true if both p and q are true and in all other cases it is false] The truth table of..

Summary - A Boolean algebra is a set B with two distinct elements, along with the binary operations '+' and '.' and a unary operation (') which satisfy closure property, commutative property, existence of unit element, distributive property for both the binary operations. Moreover, for all x B, the..

If p has the truth value T and q has the truth value F, then p q has the truth value F (T F = F). If p has the truth value T, q has the truth value F. p: x is a prime number q: x 2 is a prime number p q: If x is a prime number then x 2 is no..

An argument is a statement which assets that a given set of n compound statements p 1 ,p 2 ,..........p n yield another compound statement ..