Application of logic to the switching circuit part-1


We know that a statement in logic is either true or false. 


 The same situation occurs in electric switches. 
A working switch is either on (closed) or off (open).
If a switch is ‘on’ it allowed electric current to pass the circuit and lamp glows and if the switch is ‘open’ it does not allow current to pass the circuit and lamp does not glow.
We shall denote ‘on’ switches by letters S, , , ,… and open switches are denoted by letters
S’, , ,…But the symbol is used to denote both the switches are the same  only differ by the letters S and S’.
Let the statement p denote the ‘switch S is closed’ and lamp with light by l. Then its symbolic form is p  l.
Let ~p: the switch S’ is closed and lamp with no light by l’
Then its symbolic form is ~p  l’.
Switches connected in the circuit in two different ways
1. In series 2. In parallel.
1. Switches connected in series
switching circuit
Add caption

Let p: the switch is closed and
q: the switch is closed
If and  are both closed  then lamp glows. If either or or both are open then the lamp does not glow. Its input output table is
S1
S2
Lamp
1
1
glows
1
0
does not glow
0
1
does not glow
0
0
does not glow
 This table is same as truth table of p q i.e. conjunction of p and q. Therefore switches connected in series can be represented by  p q  l and its input output table is
p
q
p q
1
1
1
1
0
0
0
1
0
0
0
0
2. Switches connected in parallel
switching circuit

 Let p: the switch is closed and
q: the switch is closed
If and  are both open  then lamp does not glow. If either or or both are closed  then the lamp  glows. Its input output table is
S1
S2
Lamp
1
1
glows
1
0
 glows
0
1
 glows
0
0
does not glow
 This table is same as truth table of p V q i.e. disjunction ‘p or q’. Therefore switches connected in parallel can be represented by  p V q  l.and its input output table is
p
q
p V q
1
1
1
1
0
1
0
1
1
0
0
0
In this way we have seen how a switching circuit is represented by a logical statement.
 In my next post we are going to solve more examples on the switching circuits.

Comments

Post a Comment

Popular posts from this blog

Double implication or biconditional

Image
Hello friends, Welcome to my blog mathstips4u. In my last post we have seen implication and its truth table and some of its examples. Some of important examples I intentionally left as exercise. The solution of these examples is provided at the end of this post.  We shall start with Bi-conditional or double implication ( ↔ ) : Let p and q be two simple statements. Then the compound statement ‘p if and only if q’ is called the bi-conditional or double implication, denoted by p ↔q or p = ＞ q . It is read as p implies and implied by q. p ↔q is defined to have the truth value ‘true’ if p and q both have the same truth values. Otherwise   p ↔q is defined to have the truth value ‘false’. Truth table of bi-conditional p ↔q p q p ↔q T T T T F F F T F F f T Note: 1. p ↔q, q ↔p both are same. 2. p ↔q is the conjunction of a conditional and its converse i.e. p → q and ...
Read more

Converse, Inverse and contrapositive of an implication

Image
Hello friends, Welcome to my blog mathstips4u. In my last post we have seen logical equivalence and some of their examples. In this post we are going to learn converse , inverse and contrapositive of an implication and some of their examples. If p → q is an implication, then there arises following three implications 1.      q → p is called converse of p → q 2.        ~ p →    ~q is called inverse of p → q 3.         ~ q →    ~ p is called contrapositive of p → q We shall see the truth table of converse , inverse and contrapositive of an implication. p q ~ p ~ q p → q conditional q → p converse ~ p →~q inverse ~ q → ~ p contrapositive T T F F T T T T T F F T F T T F F T T F T F F T ...
Read more

Application of logic to the switching circuit part-2

Image
In this post we are going to see two types of examples on the application of logic to the switching circuits.   A) how to express the given circuit in symbolic form of logic and B) how to construct the switching circuits if the logical statements are given.   So let’s begin. Ex. A) Express the following circuits in symbolic form of logic. In the circuit there are one S1 switch, two S2’ switches, one S3 switch and one S3’ switch. Let p: the switch S1 is closed.             ~q: the switch S2’ is closed.              r: the switch S3 is closed.          \  ~r: the switch S3’ is closed. The switch S2’ and S3 are connected in parallel and they are connected in series with the switch S1. Its symbolic form is p & (~q v r) . The switches S2’ and S3’ are connected in series. Its symbolic form  is...
Read more