Spec

Fragmentos de código

curl "https://api.oanor.com/truthtable-api/v1/meta" \
  -H "x-oanor-key: oanor_test_..."

await fetch("https://api.oanor.com/truthtable-api/v1/meta", {
  headers: { "x-oanor-key": "oanor_test_..." }
});

$ch = curl_init("https://api.oanor.com/truthtable-api/v1/meta");
curl_setopt($ch, CURLOPT_HTTPHEADER, ["x-oanor-key: oanor_test_..."]);
curl_setopt($ch, CURLOPT_RETURNTRANSFER, true);
$out = curl_exec($ch);

import requests
requests.get(
    "https://api.oanor.com/truthtable-api/v1/meta",
    headers={"x-oanor-key": "oanor_test_..."}
)

Respuesta de ejemplo

Una respuesta real de este endpoint, capturada en la última comprobación de estado.

{
    "data": {
        "name": "Truth Table API",
        "notes": "Up to 12 variables (4096 rows) for the table. Precedence: NOT > AND > XOR > OR > IMPLIES > IFF; IMPLIES is right-associative. NOT is prefix only. Nothing is stored.",
        "version": "v1",
        "endpoints": [
            {
                "path": "/v1/table",
                "params": {
                    "expression": "the boolean expression, e.g. A AND (B OR !C)"
                },
                "returns": "variables, every row, minterms, classification and canonical SOP"
            },
            {
                "path": "/v1/evaluate",
                "params": {
                    "assign": "the assignment, e.g. A=1,B=0,C=1",
                    "expression": "the boolean expression"
                },
                "returns": "the boolean result for that assignment"
            },
            {
                "path": "/v1/meta",
                "params": [],
                "returns": "this document"
            }
        ],
        "operators": {
            "or": "| || ∨ + OR",
            "and": "& && ∧ * . AND",
            "not": "! ~ ¬ NOT",
            "xor": "^ ⊕ XOR",
            "other": "NAND NOR XNOR, -> => → IMPLIES, <-> <=> ↔ IFF",
            "constants": "0 1 true false"
        },
        "description": "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 (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 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 truth tables; for arithmetic use a math API."
    },
    "meta": {
        "timestamp": "2026-06-03T17:42:16.983Z",
        "request_id": "dd904c7b-be2a-48f5-a404-3c3949606604"
    },
    "status": "ok",
    "message": "Meta",
    "success": true
}