Hello MHF. I am stuck on a problem that goes like this:

Write the boolean AND-OR expression for the following:

function x in Figure 10.17

I don't understand how to get a boolean expression from that truth table. Are true and false reversed for this problem meaning, True = 0 and False = 1? And do I just write down the expressions everywhere x = 1? So for example where a, b, and c are 0 and x=1, the expression for that part would be abc? Here's what I have so far:

abc + abc' + ab'c + a'bc + a'bc' + (abc)'

Is that right?