fuzzy logic 2

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. Trut..

There are digital circuits which either allow a signal to pass through or stop it. The circuits other wise called as gate allows the signal to pass only when some logical condition are satisfied. Under such condition the circuits are called logic gates. They are building blocks ..

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..

Let us refer to a circuit consisting of two switches p and q connected in series with a lamp and battery as shown in figure. The lamp will glow, only if switch p and switch q are closed. If we replace the word 'closed' by T and 'open' by F, the switch will glow only if p = T and q = T...

Let us refer to a circuit consisting of two switches p and q connected in parallel with a lamp and battery as shown in figure. In this case, the lamp will glow if and only if at least one of the switches is closed. In binary language we say the switch will glow if at least one of the v..

Summary - - A sentence is a statement if it is either true or false, but not both. - The truth and falsity of a statement is its truth value. - A truth table indicates the truth values of a number of statements and their compound statements in a compact form. - If there are n statements, then there..

Argument - 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 Q. This is denoted by where p 1 ,p 2 ,..........p n are called hypotheses or premises or assumptions. The compound statement Q is..

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 not a prime number. This stateme..

The theory of finite sets is, arguably, a definition of Combinatorics. In particular, certain combinatorial topics (e.g. Ramsey theory) have important direct analogues in "combinatorial" set theory. Since Axiomatic Set Theory is often used to construct the natural numbers (satisfying the Pean..

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 practice, electronic engin..