Minimize boolean & propositional expressions
Logic minimizer is an innovative, versatile application for simplifying karnaugh maps and logical expressions step by step. It is geared for those involved in engineering fields, more precisely digital and formal logic scholars and academics, digital devices constructors or anybody involved with logical expressions.
With its powerful minimization capabilities and full fledged features, you can work with all forms of logic expressions
Features: minimize boolean and propositional formulae up to 24 variables convert boolean formulae into sop, pos and decimal notation work with karnaugh map, truth table and sets of terms highlight minimized term on karnaugh map draw logic circuit with various types of logic gates optimize simplified boolean formula with xor gates convert propositional formulae into dnf and cnf find validity of propositional formulae support all boolean and propositional operators formula input friendly: no need to transform your formula before entering step by step simplification of boolean and propositional expressions