Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
lean truth table solution in Speedy category for Boolean Algebra by cherwin
OPERATION_NAMES = ("conjunction", "disjunction", "implication", "exclusive", "equivalence")
def boolean(x, y, operation):
return int({
"conjunction": x and y,
"disjunction": x or y,
"implication": not(x) or y,
"exclusive": x ^ y,
"equivalence": x == y,
}[operation])
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert boolean(1, 0, "conjunction") == 0, "and"
assert boolean(1, 0, "disjunction") == 1, "or"
assert boolean(1, 1, "implication") == 1, "material"
assert boolean(0, 1, "exclusive") == 1, "xor"
assert boolean(0, 1, "equivalence") == 0, "same?"
May 31, 2016
