THE GATEBOOK

Normalization Lectures

Let be the set of all propositions generated by and (Where and are Two Propositions) using at most one of the following logical operations : , Where are NAND and NOR operators respectively.

i.e.

A Relation is defined on such that is Tautology.

The relation R is

(A). Reflexive, symmetric, Transitive

(B). Reflexive, symmetric, Not transitive

(C). Reflexive, anti-symmetric, Transitive

(D). Irreflexive, asymmetric, Transitive

R is reflexive because is always a Tautology.

R is antisymmetric. and implies . Since, no two elements in the set L are equivalent so R is antisymmetric.

R is transitive because Implication operation is Transitive.