Why sum of minterms or product of maxterms gives us the boolean function?

Click For Summary
The discussion centers on understanding why the sum of minterms or product of maxterms represents a Boolean function. A specific example illustrates how the function is derived from the truth table of two variables, x and y, leading to the expression x'y + y'x. An intuitive explanation is provided using a Venn diagram to visualize how different areas correspond to combinations of truth values. The key point is that a Boolean function is defined by its truth table, where the function evaluates to true for specific combinations of inputs. Overall, the relationship between minterms and the resulting function is clarified through logical reasoning and visual representation.
Avichal
Messages
294
Reaction score
0
I have thought about it and every-time I think I have an answer I try to explain it to myself and I fail. I want an intuition behind it and if there is a proof better.

Thank you
 
Physics news on Phys.org
You might get an answer if you state the question clearly.
 
Stephen Tashi said:
You might get an answer if you state the question clearly.
Oh okay, sorry if it was not clear
For example say two Boolean expressions x and y: its function is given
x y F
0 0 0
0 1 1
1 0 1
1 1 0

To find the function we need to add the minterms which are x'y and y'x. So function is x'y+y'x.
On what is minterms the link is here

But I don't understand why adding the minterms gives us the function.
 
I'll suggest an intuitive way.

Visualize a Venn diagram where we have draw overlapping circles X and Y on a piece of paper. Smaller areas on the paper can be described by "coordinates" that tell whether the area is in-or-out of each set. So the possible coordinates in the descriptions are:

X \cap Y
]X \cap Y^c
X^c \cap Y
X^c \cap y^c

Any area that you can make using only some the above pieces can be written as a union of some of the pieces.

Of course you could draw an irregular area on the page that could not be described by the above procedure. For example, you could draw an area that was partly in X \cup Y and partly out of X \cup Y. Such an area would not be "a function of" X and Y.

Returning to propositions, if a propositional function is a function of propositions x and y then it has a truth table. In the left columns of the table are listed all combinations of the truth and falsity values of x and y. The function is 1 precisely in the cases where the rows of its truth table make it 1. So writing the function as something like x'y + y'x amounts to saying the function is true on the rows of the truth table where entries of the leftmost two columns show the truth of x'y or y'x and it isn't true on any other rows.
 
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
6K
  • · Replies 40 ·
2
Replies
40
Views
8K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K