Boolean Algebra
Simplified in Seconds

24 free digital logic tools. Simplify expressions, solve Karnaugh maps, export to Structured Text, Ladder Logic & VHDL.

Karnaugh MapsDe Morgan's LawsStructured TextLadder LogicVHDL Export

>_ Simplify

Original
Simplified
0%
Reduction
0
Gates Before
0
Gates After

Need more power?

Go Pro: unlimited variables, export to Structured Text, Ladder Logic, VHDL, full API access.

Upgrade — 4.99€/month

API Documentation

Integrate Boolean simplification into your pipeline. REST API, JSON in/out.

Endpoint
POST https://n8n.iaspacdz.live/webhook/api/optimize
Authorization: Bearer YOUR_API_KEY
Content-Type: application/json
Request — Expression mode
{
  "expression": "A AND B OR A AND C OR NOT A AND B",
  "output_format": "boolean"
}
Request — Truth table mode
{
  "truth_table": {
    "variables": ["A", "B", "C"],
    "outputs": [0, 0, 1, 1, 0, 1, 1, 1]
  },
  "output_format": "structured_text"
}
Response
{
  "original": "A AND B OR A AND C OR NOT A AND B",
  "simplified": "B OR (A AND C)",
  "reduction_percent": 42,
  "gates_original": 5,
  "gates_simplified": 3,
  "verified": true,
  "structured_text": "output := B OR (A AND C);",
  "ladder_logic": "--[B]----(OUT)--\n--[A]--[C]--(OUT)--",
  "vhdl": "output <= B or (A and C);"
}
Output formats
// Available output_format values:
"boolean"        // Default
"structured_text" // IEC 61131-3
"ladder"         // Ladder Logic (ASCII)
"vhdl"           // VHDL signal assignment
"all"            // All formats

Pricing

Pay per request or subscribe for high-volume use.

Pay As You Go

5€ / 10 credits

For occasional use

  • 0.50€ per request
  • Unlimited variables
  • All export formats
  • Verification included
  • Credits never expire

Yearly

49.99€/yr

Unlimited — Best value

  • Unlimited requests
  • Unlimited variables
  • All export formats
  • Batch processing
  • Dedicated support

Use Cases

Built for engineers, students, and developers.

PLC Engineers

Clean up legacy ladder logic. Reduce gate count in existing PLCs. Export directly to Structured Text for Siemens, Allen-Bradley, Schneider.

🎓

Students

Solve Karnaugh maps instantly. Verify your Boolean algebra homework. Understand step-by-step simplification with truth tables.

🔌

No-Code Developers

Simplify complex IF/ELSE workflows. Turn messy conditional logic into clean, minimal expressions for Zapier, Make, n8n.

FPGA Designers

Optimize gate count for synthesis. Export to VHDL. Reduce LUT usage and improve timing closure on Xilinx, Intel, Lattice FPGAs.

All 24 Tools

Everything you need for digital logic, in one place.

Activate Pro License

Enter your PRO license key to unlock unlimited access.

Don't have a key? Get Pro