symbolic logic mathematics

Let A = [aij] be a square matrix. We can associate with the square matrix A, a determinant which is formed by exactly the same array of elements of the matrix A. A determinant formed by the same array of elements of the square matrix A is called the determinant of the square matrix A and is ..

Permutations - The different arrangements that can be made with a given number of things taking some or all of them at a time are called permutations. The symbol n P r or P(n,r) is used to denote the number of permutations of n things taken r at a tim..

Let A = [a ij ] be a square matrix. We can associate with the square matrix A, a determinant which is formed by exactly the same array of elements of the matrix A. A determinant formed by the same array of elements of the square matrix A is called the determinant of the square matrix A and is denot..

Introduction - The study of logic through the use of mathematical symbols is called Mathematical Logic. Mathematical logic is also known as Symbolic Logic or Boolean Logic..

Normally propositions are joined by 'OR', 'AND', 'NOT', 'IF .. THEN..' and 'IF AND ONLY IF' called the logical connectives . They are symbolised as follows: If two or more statements are combined by the use of words like 'AND', 'OR', 'IF AND ONLY IF ', then the resulting statement is ..

Logic is the study and analysis of valid arguments. The arguments are in the form of statements or propositions, which are either true or false, but not both. There are also some statements, which appear to be true and false at the same time. They are called paradoxes. The study of l..

Application to Switching Circuits - The application of Boolean algebra to electronic devices such as computers, lies in the restriction of the variable to two possible condition 'On and Off' or 'True or False' or numerically '1 or 0'. The electric circuits carry out the Boolean logic. In ..

x.y' + x.z + y.z' A Boolean expression can be regarded as a Boolean function since it has a unique value, either 0 or 1. The postulates, theorems or Boolean expressions in Boolean algebra hold good when the operation '+' and '.', the symbols '1' and '0' are interchanged, this is called ..

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 truth table. Truth Table fo..

Logical Equivalence and Duality - 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 ..