ASSIGNMENT -4

NAME – RAYALA ANIL

STD NO – 110-00-3157

1) When implemented, a minterm Boolean expression produces what pattern

Of logic gate ?

A  min term is a Boolean expression resulting in 1 for the output of a single cell, and 0s for all other cells in a
Karnaugh map, or truth table. If a min term has a single 1 and the remaining cells as 0s, it would appear to cover a
minimum area of 1s. The illustration above left shows the min term ABC, a single product term, as a single 1 in a
map that is otherwise 0s. We have not shown the 0s in our Karnaugh maps up to this point, as it is customary to omit
them unless specifically needed. Another min term A'BC' is shown above right. The point to review is that the
address of the cell corresponds directly to the min term being mapped. That is, the cell 111 corresponds to the min
term ABC above left. Above right we see that the min term A'BC' corresponds directly to the cell010. A Boolean
expression or map may have multiple min terms.

THE steps involved in this process

 Identify the min term (product term) term to be mapped.

 Write the corresponding binary numeric value.
 Use binary value as an address to place a 1 in the K-map
 Repeat steps for other min terms (P-terms within a Sum-Of-Products).

A Boolean expression will more often than not consist of multiple min terms corresponding to multiple cells in a
Karnaugh map as shown above. The multiple min terms in this map are the individual min terms which we examined
in the previous figure above. The point we review for reference is that the 1s come out of the K-map as a binary cell
address which converts directly to one or more product terms. By directly we mean that a 0 corresponds to a
complemented variable, and a 1 corresponds to a true variable. Example: 010 converts directly to A'BC'. There was
no reduction in this example. Though, we do have a Sum-Of-Products result from the minterms.
Referring to the above figure, Lets summarize the procedure for writing the Sum-Of-Products reduced Boolean
equation from a K-map:

 Form largest groups of 1s possible covering all minterms. Groups must be a power of 2.
 Write binary numeric value for groups.
 Convert binary value to a product term.
 Repeat steps for other groups. Each group yields p-terms within a Sum-Of-Products.

Nothing new so far, a formal procedure has been written down for dealing with minterms. This serves as a pattern for
dealing with midterms.

Next we attack the Boolean function which is 0 for a single cell and 1s for all others.

2. A maxterm is a Boolean expression resulting in a 0 for the output of a single cell expression, and 1s for all other
cells in the Karnaugh map, or truth table. The illustration above left shows the maxterm (A+B+C), a single sum term,
as a single 0 in a map that is otherwise 1s. If a maxterm has a single 0 and the remaining cells as 1s, it would appear
to cover a maximum area of 1s.
There are some differences now that we are dealing with something new, maxterms. The maxterm is a 0, not a 1 in
the Karnaugh map. A maxterm is a sum term, (A+B+C) in our example, not a product term.
It also looks strange that (A+B+C) is mapped into the cell 000. For the equation Out=(A+B+C)=0, all three
variables (A, B, C) must individually be equal to 0. Only (0+0+0)=0 will equal 0. Thus we place our sole 0 for
minterm (A+B+C) in cell A, B, C=000 in the K-map, where the inputs are all0. This is the only case which will give us
a 0 for our maxterm. All other cells contain 1s because any input values other than ((0, 0, and
0) for (A+B+C) yields 1s upon evaluation

 Identify the Sum term to be mapped.

 Write corresponding binary numeric value.
 Form the complement
 Use the complement as an address to place a 0 in the K-map
 Repeat for other maxterms (Sum terms within Product-of-Sums expression).
Another maxterm A'+B'+C' is shown above. Numeric 000 corresponds to A'+B'+C'. The complement is 111. Place
a 0 for maxterm (A'+B'+C') in this cell (1, 1, 1) of the K-map as shown above.
Why should (A'+B'+C') cause a 0 to be in cell 111? When A'+B'+C' is (1'+1'+1'), all 1s in, which is (0+0+0) after
taking complements, we have the only condition that will give us a 0. All the 1s are complemented to all 0s, which
is 0 when ORed.

Most many-valued or normal logics usually agree with the truth table results
for the values of truth and falsity. For example, in classical logic, only one
conjunct has to be false for the whole sentence to be false. As a result, 6
out of the 9 positions in a many-valued truth table are already filled in a
manner identical to in a truth table in bivalent logic. How we fill in the
remaining slots depends on how we regard indeterminate sentences. And
the different ways that different logicians use regarding indeterminate truth
values of each of the various connectives distinguishes their respective
theories.
NEGATION
-A is true iff A is false

A | ~A

T | F

I | I

F | T

Both Kleene and chief competitors agree on this analysis of negation.

NOTE: If you cannot determine whether the resulting truth value

is T or F, it must be I.

CONJUNCTION

CONJUNCTION

A&B T I F

A T T I F

I I I F

F F F F

 a conjunction is true if both conjuncts are true

 a conjunction is false if either conjunct are false

Example: The sentence “Holmes lived in London as a child and Holmes

took a bus to school.” is indeterminate.

TEST: If a compound has the same truth value whether a component is T

or F, it also has that same value if that component is Indeterminate. In
contrast, if the truth value of the compound depends on the truth values of
both components, then whenever one component is indeterminate, so is
the truth value of the compound (whole) sentence.

For example, if A is T and we have A & B, whether the whole sentence is

true depends on whether B is true or not. So the conjunction fails the test,
and the remaining slots of components with indeterminate truth values are
indeterminate.

Again, both Kleene and chief competitors agree on this analysis of

conjunctions.

DISJUNCTION

AvB T I F

A T T T T

I T I I

F T I F
 If either disjunct is true, the compound sentence is true.

 If both disjuncts are false, the compound sentence is false.

 We apply the test to fill in the values not already given by classical logic.
For example, if A is T and we have A v B, the whole sentence is true no
matter whether B is true or false. Therefore, the sentence would be true
if B were indeterminate. Otherwise, the value is indeterminate.

Example: The sentence “Holmes lived in London as a child or Holmes

took a bus to school.” is indeterminate.

Both Kleene and chief competitors agree on this analysis of disjunctions.

CONDITIONALS
There are three different approaches to analyzing the truth tables of
conditional statements. As a result, there are three different logics:
Kleene’s logic, Lukasiewicz’s logic, and Godel’s logic.

KLEENE’S APPROACH

CONDITIONAL (K3)

AB T I F
A T T I F

I T I I

F T T T

 If the antecedent of a conditional is false, the compound sentence is

true.

 If the antecedent of a conditional is true and the consequent is false,

then the compound sentence is false.

 If the consequent is true, the whole sentence is true.

 Makes the three remaining positions indeterminate.

RESULT: An indeterminate that implies an indeterminate, an

indeterminate.

Consequence: p  p is not a tautology. Furthermore, there are no

tautologies in Kleene’s logic.

Example: The sentence “If Holmes lived in London as a child, then

Holmes lived in London as a child.” is indeterminate, rather than
true.

LUKASIEWICZ’S APPROACH
In reaction against this, Lukasiewicz makes the truth value of a conditional
with two indeterminates true.

CONDITIONAL (L3)

AB T I F

A T T I F

I T T I

F T T T

For Lukawiecz, if the truth values of the antecedent and consequent are
indeterminate, then the truth value of the whole is true.

Consequence: In L3, p p is a logical truth, true even when the

antecedent and the consequent are both indeterminate.

Example: The sentence “Holmes lived in London as a child, then Holmes

lived in London as a child.” is true.

GODEL’S APPROACH
Godel’s modification is to make a conditional with an indeterminate
antecedent and a false consequent false.
CONDITIONAL (G3)
B

AB T I F

A T T I F

I T T F

F T T T