#logic

Evaluate boolean-logic expressions and generate complete truth tables. The table endpoint takes a boolean expression, finds its variables, builds every row of the truth table (the first variable is the most-significant bit, the standard convention), and returns each row's values and result, the list of minterms (the row indices where the expression is true), a classification of tautology / contradiction / contingency, and a canonical sum-of-products (SOP) form. The evaluate endpoint computes the expression's value for one specific assignment of its variables. It understands the full set of operators in both symbol and word form — NOT (!, ~, ¬), AND (&, &&, ∧, *, ., AND), OR (|, ||, ∨, +, OR), XOR (^, ⊕), NAND, NOR, XNOR, implication (->, =>, →, IMPLIES) and the biconditional (<->, <=>, ↔, IFF) — with the usual precedence (NOT > AND > XOR > OR > IMPLIES > IFF), parentheses, and the constants 0/1 and true/false. Everything is computed locally and deterministically, so it is instant and private. Ideal for digital-logic and discrete-math teaching, hardware and HDL design, simplifying conditions in code, SAT-style sanity checks, and interview prep. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 3 endpoints. This evaluates boolean logic and builds truth tables; for arithmetic and equations use a math API.

api.oanor.com/truthtable-api