how to do boolean algebra
im currently studying algebra but i havent been able to figure out how to use sagemath in my study of this field like i did with linear algebra or calculus, perhaps sagemath doesnt provide the proper functionality related to this field? well im here to figure out
for example in my case i want to create a boolean functions using its minterms, check for functional completeness, find the simplest switching expression using karnaugh maps, etc etc, is this possible to achieve in sagemath without writing some ugly python code?
thank you
As far as I now, Sage's propositional logic module doesn't iplement what you are aiming at, but the tools it offers may help you to implement it.