LMD Async Tutoring

Okay I’ll start with three logic trees. Small, medium, big.

Actually, I’ll make three more so I can convert some to infix and some to prefix.


first three prefix:

(left to right):

not(and (x, not(y))

or(and(not(x), not(y)), or(x, y))

not(and(or(not(x), and(x, y)), not(and(x, or(x, y)))))


second three infix:

(left to right):

~x^y

(x^y)v~(x^y)

((x v y)^x)^((x^~y)v(x v y))

Ill try those infix ones with the different symbols:

!x & y

(x & y) | !(x & y)

((x | y) & x) & ((x & !y) | (x | y))

1 Like