Wednesday, 8 February 2012

Math Blog on Disjuction

Today I will tell you about this field of binary system: Disjunction in discreet math. Disjunction is very important and interesting term in discrete math. Discrete is a truth function of binary whose output will always be true if the applied input is also true, otherwise it will be false for input having false state. In logic and mathematics it is also known as the alteration, inclusive disjunction. We use OR to express it. A logical disjunction is basically is an operation that is applied on two logical values. These values always produce false value if and only if both the operands and values are false otherwise it is true if either one or both operands are true. This is a function having two literals which are separated by OR. Here are some examples of disjunction: (To get help on icse board syllabus click here)

If we have A = 0 and B = 0 then A V B = 0.
Similarly if we have A = 0 and B = 1 then A V B = 1.
Here are some properties of disjunction:
Let us take three operands which have some logical values true/ false or 0/1. These operands are A, B, C. So the properties of disjunction are followings:
1.       Commutative: According to this property the Disjunction of A and B is equal to the Disjunction of B and A i.e. (AVB) = (BVA).
2.       Associative: According to this AV(BVC) = (AVB)VC.
3.       Distributive: In this property of disjunction it uses two operations OR and AND i.e.  A V (B>C) = (AVB) > (AVC).
4.       Identity: In this property if we make OR of the same operand then we will get the same operand as the result. I.e. A V A = A
So from the above description we learnt about disjunction and some interesting properties of disjunction. In the next topic we will discuss about the conditional and In the next session we will discuss about Conjunction in discreet maths.

No comments:

Post a Comment