Discrete Math

Logical Equivalence – Identity Law

 12 total views

 12 total views Earlier you learned about the logical equivalence and how two or more compound prepositions makes a tautology and prove their equivalence. There are many well-known , so first one is identity law. We call it law because the same logic is applied in which is another branch of mathematics, that studies and understand …

Logical Equivalence – Identity Law Read More »

Prepositional Logic – Duality

 68 total views

 68 total views We know that the simple statements are represented as p, q and so on. Suppose we are given a compound preposition. There is another property of compound prepositions called the duality; Therefore, the dual of above statement is The dual can be achieved by interchanging by or interchanging by . This means and …

Prepositional Logic – Duality Read More »

Finite Probability

 7 total views

 7 total views Finite Probability is a very important concept in discrete mathematics. Before we begin let’s understand some basic terminology, that is important in understanding probability theory. Basic Terminologies Experiment  An experiment is some task you do and get an outcome, possibly from a set of different outcomes. Example, throwing a dice would result in a number between …

Finite Probability Read More »

Logical Equivalence

 32 total views

 32 total views We have seen prepositions, connectives and compound prepositions; all possible combinations of truth values of the individual prepositions in a compound preposition is depicted in a truth-table. However, it is possible that another preposition or compound preposition has the same truth values in the truth table. This is called logical equivalence of two …

Logical Equivalence Read More »

Prepositional Logic-Implication and Biconditional

 47 total views

 47 total views In the previous video, you learned about different types of basic logical connectives that helps in creating compound prepositions. These connectives are join two or more atomic statements to form compound preposition which also have a truth value of its own. We have discuss negation, conjunction, and disjunction connectives so far, the remaining …

Prepositional Logic-Implication and Biconditional Read More »

How to create a Hasse Diagram

 75 total views

 75 total views Hasse Diagram is created for POSET or Partially Ordered Set. It means that there is a set of elements in which certain element are ordered, sequenced or arranged in some way. It is usually denoted as ≤, this is not “Less than, Equal to”, this symbol shows that elements are ordered. Now, there …

How to create a Hasse Diagram Read More »