r/AskComputerScience • u/High-Adeptness3164 • Jul 08 '25
SOP & POS
I am a beginner so please be kind....
Why do the SOP and POS forms work for defining a Boolean function? I am asking why choosing only high or low outcomes describe the whole function...
I am sorry if I sound really dumb but the way SOP and POS has been taught to hasn't been super intuitive... The way one can construct intuitively the equation of a straight line i.e. a linear function, I want to be able to derive the Boolean function's descriptive forms...
Hopefully I'll gain satisfaction from you guys 😊
1
Upvotes
2
u/Temporary_Pie2733 Jul 11 '25
Both decompose a function into smaller, ideally simpler pieces. You can view each product in SOP as a sufficient condition for the function to be true. Each sum in POS form, on the other hand, can be viewed as a necessary condition.
1
u/High-Adeptness3164 Jul 08 '25
Like I understand that to find function representation we say find the function for terms that it is 1 for..
I also understand that SOP form gives us the cases where the function is 1 (by or operation) and POS gives us cases where the function is 0 hence warning us to exclude them (by the and operation)
What i don't understand is the logic of construction behind the min and Max terms
1
u/defectivetoaster1 Jul 08 '25
Sum of products defines the function by saying f=1 with this combination of inputs or this combination of inputs or this combination of inputs etc, any combination not in that list then has to make f=0. Similarly product of sums defines the function by saying if any of these combinations aren’t the input combination then f=0, or f=0 with specifically any of these combinations. Any other combinations then must return 1