@stevenvo780/st-lang 4.2.0 → 4.3.0

package/dist/profiles/many-valued/index.js

@@ -0,0 +1,250 @@
+"use strict";
+// ============================================================
+// ST Many-valued logics — Łukasiewicz, Gödel, Product
+// ============================================================
+// Tres lógicas borrosas / multivaluadas con valores en [0, 1].
+// Cada sistema define sus propias conectivas, con un núcleo
+// común: T-norm + T-conorm + implicación residuada + negación.
+//
+// Sistemas:
+//   * lukasiewicz: t-norm = max(0, p+q-1), s-norm = min(1, p+q),
+//                  imp = min(1, 1-p+q), neg = 1-p (involutiva).
+//   * godel:       t-norm = min(p, q), s-norm = max(p, q),
+//                  imp = 1 si p<=q, q en otro caso;
+//                  neg(p) = 1 si p=0, 0 en otro caso.
+//   * product:     t-norm = p*q, s-norm = p + q - p*q,
+//                  imp = 1 si p<=q, q/p en otro caso;
+//                  neg(p) = 1 si p=0, 0 en otro caso.
+//
+// Una tautología es una fórmula cuyo valor es 1 para toda
+// asignación; aquí "toda asignación" se aproxima por sampling
+// en una rejilla finita (resolution puntos por átomo).
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.atom = atom;
+exports.not = not;
+exports.and = and;
+exports.or = or;
+exports.implies = implies;
+exports.collectFuzzyAtoms = collectFuzzyAtoms;
+exports.evaluate = evaluate;
+exports.isTautology = isTautology;
+exports.isContradiction = isContradiction;
+exports.findValuation = findValuation;
+// ── Helpers numéricos ───────────────────────────────────────
+/** Recorta x al intervalo [0,1] absorbiendo error de coma flotante. */
+function clamp01(x) {
+    if (Number.isNaN(x))
+        return 0;
+    if (x < 0)
+        return 0;
+    if (x > 1)
+        return 1;
+    return x;
+}
+// ── Conectivas por sistema ──────────────────────────────────
+function tnorm(system, p, q) {
+    switch (system) {
+        case 'lukasiewicz':
+            return clamp01(Math.max(0, p + q - 1));
+        case 'godel':
+            return Math.min(p, q);
+        case 'product':
+            return clamp01(p * q);
+    }
+}
+function snorm(system, p, q) {
+    switch (system) {
+        case 'lukasiewicz':
+            return clamp01(Math.min(1, p + q));
+        case 'godel':
+            return Math.max(p, q);
+        case 'product':
+            return clamp01(p + q - p * q);
+    }
+}
+function implication(system, p, q) {
+    switch (system) {
+        case 'lukasiewicz':
+            return clamp01(Math.min(1, 1 - p + q));
+        case 'godel':
+            return p <= q ? 1 : q;
+        case 'product':
+            if (p <= q)
+                return 1;
+            if (p === 0)
+                return 1;
+            return clamp01(q / p);
+    }
+}
+function negation(system, p) {
+    switch (system) {
+        case 'lukasiewicz':
+            return clamp01(1 - p);
+        case 'godel':
+        case 'product':
+            return p === 0 ? 1 : 0;
+    }
+}
+// ── Constructores de fórmulas ───────────────────────────────
+function atom(name) {
+    return { kind: 'atom', name };
+}
+function not(arg) {
+    return { kind: 'not', arg };
+}
+function and(left, right) {
+    return { kind: 'and', left, right };
+}
+function or(left, right) {
+    return { kind: 'or', left, right };
+}
+function implies(left, right) {
+    return { kind: 'implies', left, right };
+}
+// ── Atoms collection ────────────────────────────────────────
+function collectFuzzyAtoms(formula) {
+    const set = new Set();
+    const visit = (f) => {
+        switch (f.kind) {
+            case 'atom':
+                if (f.name)
+                    set.add(f.name);
+                return;
+            case 'not':
+                if (f.arg)
+                    visit(f.arg);
+                return;
+            case 'and':
+            case 'or':
+            case 'implies':
+                if (f.left)
+                    visit(f.left);
+                if (f.right)
+                    visit(f.right);
+                return;
+        }
+    };
+    visit(formula);
+    return Array.from(set).sort();
+}
+// ── Evaluación ──────────────────────────────────────────────
+/**
+ * Evalúa una fórmula borrosa bajo un environment que asigna
+ * un valor en [0,1] a cada átomo (átomos sin asignar valen 0).
+ */
+function evaluate(formula, env, system) {
+    switch (formula.kind) {
+        case 'atom': {
+            const v = formula.name ? env[formula.name] : undefined;
+            return clamp01(v ?? 0);
+        }
+        case 'not':
+            return negation(system, formula.arg ? evaluate(formula.arg, env, system) : 0);
+        case 'and':
+            return tnorm(system, formula.left ? evaluate(formula.left, env, system) : 0, formula.right ? evaluate(formula.right, env, system) : 0);
+        case 'or':
+            return snorm(system, formula.left ? evaluate(formula.left, env, system) : 0, formula.right ? evaluate(formula.right, env, system) : 0);
+        case 'implies':
+            return implication(system, formula.left ? evaluate(formula.left, env, system) : 0, formula.right ? evaluate(formula.right, env, system) : 0);
+    }
+}
+// ── Sampling sobre la rejilla [0,1]^n ───────────────────────
+/** Genera la rejilla {0, 1/(r-1), ..., 1} de `resolution` puntos. */
+function gridPoints(resolution) {
+    if (resolution < 2)
+        return [0, 1];
+    const out = [];
+    for (let i = 0; i < resolution; i++) {
+        out.push(i / (resolution - 1));
+    }
+    return out;
+}
+/**
+ * Itera todas las combinaciones de la rejilla sobre los átomos,
+ * llamando a `visit(env, value)` con cada valuación y el valor
+ * de la fórmula. Si `visit` devuelve `false`, aborta.
+ */
+function forEachValuation(formula, system, resolution, visit) {
+    const atoms = collectFuzzyAtoms(formula);
+    if (atoms.length === 0) {
+        visit({}, evaluate(formula, {}, system));
+        return;
+    }
+    const grid = gridPoints(resolution);
+    const env = {};
+    const total = Math.pow(grid.length, atoms.length);
+    const indices = new Array(atoms.length).fill(0);
+    for (let n = 0; n < total; n++) {
+        for (let i = 0; i < atoms.length; i++) {
+            const key = atoms[i];
+            const gi = indices[i];
+            env[key] = grid[gi];
+        }
+        const value = evaluate(formula, env, system);
+        const res = visit({ ...env }, value);
+        if (res === false)
+            return;
+        // increment indices (base = grid.length)
+        for (let i = atoms.length - 1; i >= 0; i--) {
+            const idx = indices[i] + 1;
+            if (idx < grid.length) {
+                indices[i] = idx;
+                break;
+            }
+            indices[i] = 0;
+        }
+    }
+}
+// ── Tautología / Contradicción ─────────────────────────────
+const EPSILON = 1e-9;
+/**
+ * Devuelve true si la fórmula evalúa a 1 (módulo EPSILON) en
+ * todos los puntos de la rejilla [0,1]^n con `resolution` puntos
+ * por átomo. Default: 11 puntos (0, 0.1, ..., 1).
+ *
+ * Aviso: es una aproximación por sampling. Algunas tautologías
+ * "casi" (verdaderas excepto en un conjunto de medida cero)
+ * pueden seguir clasificándose correctamente, pero contraejemplos
+ * sutiles requieren resolución mayor.
+ */
+function isTautology(formula, system, resolution = 11) {
+    let ok = true;
+    forEachValuation(formula, system, resolution, (_env, value) => {
+        if (value < 1 - EPSILON) {
+            ok = false;
+            return false;
+        }
+        return undefined;
+    });
+    return ok;
+}
+/** Verdadera si la fórmula evalúa a 0 en toda la rejilla. */
+function isContradiction(formula, system, resolution = 11) {
+    let ok = true;
+    forEachValuation(formula, system, resolution, (_env, value) => {
+        if (value > EPSILON) {
+            ok = false;
+            return false;
+        }
+        return undefined;
+    });
+    return ok;
+}
+/**
+ * Busca una valuación (en la rejilla con `resolution` puntos por
+ * átomo) tal que `|evaluate(formula) - target| <= tolerance`.
+ * Devuelve null si no encuentra ninguna.
+ */
+function findValuation(formula, system, target, tolerance = 1e-6, resolution = 11) {
+    let hit = null;
+    forEachValuation(formula, system, resolution, (env, value) => {
+        if (Math.abs(value - target) <= tolerance) {
+            hit = env;
+            return false;
+        }
+        return undefined;
+    });
+    return hit;
+}
+//# sourceMappingURL=index.js.map

package/dist/profiles/many-valued/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/many-valued/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sDAAsD;AACtD,+DAA+D;AAC/D,+DAA+D;AAC/D,4DAA4D;AAC5D,+DAA+D;AAC/D,EAAE;AACF,YAAY;AACZ,iEAAiE;AACjE,gEAAgE;AAChE,2DAA2D;AAC3D,oDAAoD;AACpD,sDAAsD;AACtD,uDAAuD;AACvD,sDAAsD;AACtD,sDAAsD;AACtD,EAAE;AACF,0DAA0D;AAC1D,8DAA8D;AAC9D,uDAAuD;AACvD,+DAA+D;;AAuE/D,oBAEC;AAED,kBAEC;AAED,kBAEC;AAED,gBAEC;AAED,0BAKC;AAID,8CAoBC;AAQD,4BA+BC;AAsED,kCAcC;AAGD,0CAcC;AAOD,sCAgBC;AA3QD,+DAA+D;AAE/D,uEAAuE;AACvE,SAAS,OAAO,CAAC,CAAS;IACxB,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAC9B,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,OAAO,CAAC,CAAC;AACX,CAAC;AAED,+DAA+D;AAE/D,SAAS,KAAK,CAAC,MAAqB,EAAE,CAAS,EAAE,CAAS;IACxD,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,aAAa;YAChB,OAAO,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,KAAK,OAAO;YACV,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,KAAK,SAAS;YACZ,OAAO,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC;AAED,SAAS,KAAK,CAAC,MAAqB,EAAE,CAAS,EAAE,CAAS;IACxD,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,aAAa;YAChB,OAAO,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrC,KAAK,OAAO;YACV,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,KAAK,SAAS;YACZ,OAAO,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAC,MAAqB,EAAE,CAAS,EAAE,CAAS;IAC9D,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,aAAa;YAChB,OAAO,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,KAAK,OAAO;YACV,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxB,KAAK,SAAS;YACZ,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACtB,OAAO,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,MAAqB,EAAE,CAAS;IAChD,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,aAAa;YAChB,OAAO,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,KAAK,OAAO,CAAC;QACb,KAAK,SAAS;YACZ,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;AACH,CAAC;AAED,+DAA+D;AAE/D,SAAgB,IAAI,CAAC,IAAY;IAC/B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AAChC,CAAC;AAED,SAAgB,GAAG,CAAC,GAAiB;IACnC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AAC9B,CAAC;AAED,SAAgB,GAAG,CAAC,IAAkB,EAAE,KAAmB;IACzD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACtC,CAAC;AAED,SAAgB,EAAE,CAAC,IAAkB,EAAE,KAAmB;IACxD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACrC,CAAC;AAED,SAAgB,OAAO,CACrB,IAAkB,EAClB,KAAmB;IAEnB,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC1C,CAAC;AAED,+DAA+D;AAE/D,SAAgB,iBAAiB,CAAC,OAAqB;IACrD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,MAAM,KAAK,GAAG,CAAC,CAAe,EAAQ,EAAE;QACtC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,MAAM;gBACT,IAAI,CAAC,CAAC,IAAI;oBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC5B,OAAO;YACT,KAAK,KAAK;gBACR,IAAI,CAAC,CAAC,GAAG;oBAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACxB,OAAO;YACT,KAAK,KAAK,CAAC;YACX,KAAK,IAAI,CAAC;YACV,KAAK,SAAS;gBACZ,IAAI,CAAC,CAAC,IAAI;oBAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC1B,IAAI,CAAC,CAAC,KAAK;oBAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAC5B,OAAO;QACX,CAAC;IACH,CAAC,CAAC;IACF,KAAK,CAAC,OAAO,CAAC,CAAC;IACf,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AAChC,CAAC;AAED,+DAA+D;AAE/D;;;GAGG;AACH,SAAgB,QAAQ,CACtB,OAAqB,EACrB,GAA2B,EAC3B,MAAqB;IAErB,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACvD,OAAO,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,KAAK;YACR,OAAO,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChF,KAAK,KAAK;YACR,OAAO,KAAK,CACV,MAAM,EACN,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EACtD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CACzD,CAAC;QACJ,KAAK,IAAI;YACP,OAAO,KAAK,CACV,MAAM,EACN,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EACtD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CACzD,CAAC;QACJ,KAAK,SAAS;YACZ,OAAO,WAAW,CAChB,MAAM,EACN,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EACtD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CACzD,CAAC;IACN,CAAC;AACH,CAAC;AAED,+DAA+D;AAE/D,qEAAqE;AACrE,SAAS,UAAU,CAAC,UAAkB;IACpC,IAAI,UAAU,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CACvB,OAAqB,EACrB,MAAqB,EACrB,UAAkB,EAClB,KAAqE;IAErE,MAAM,KAAK,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;IACzC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC;QACzC,OAAO;IACT,CAAC;IACD,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;IACpC,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAElD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;YAC/B,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAW,CAAC;YAChC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAW,CAAC;QAChC,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC;QACrC,IAAI,GAAG,KAAK,KAAK;YAAE,OAAO;QAC1B,yCAAyC;QACzC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAI,OAAO,CAAC,CAAC,CAAY,GAAG,CAAC,CAAC;YACvC,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBACtB,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBACjB,MAAM;YACR,CAAC;YACD,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;AACH,CAAC;AAED,8DAA8D;AAE9D,MAAM,OAAO,GAAG,IAAI,CAAC;AAErB;;;;;;;;;GASG;AACH,SAAgB,WAAW,CACzB,OAAqB,EACrB,MAAqB,EACrB,aAAqB,EAAE;IAEvB,IAAI,EAAE,GAAG,IAAI,CAAC;IACd,gBAAgB,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QAC5D,IAAI,KAAK,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC;YACxB,EAAE,GAAG,KAAK,CAAC;YACX,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,6DAA6D;AAC7D,SAAgB,eAAe,CAC7B,OAAqB,EACrB,MAAqB,EACrB,aAAqB,EAAE;IAEvB,IAAI,EAAE,GAAG,IAAI,CAAC;IACd,gBAAgB,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QAC5D,IAAI,KAAK,GAAG,OAAO,EAAE,CAAC;YACpB,EAAE,GAAG,KAAK,CAAC;YACX,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,SAAgB,aAAa,CAC3B,OAAqB,EACrB,MAAqB,EACrB,MAAc,EACd,YAAoB,IAAI,EACxB,aAAqB,EAAE;IAEvB,IAAI,GAAG,GAAkC,IAAI,CAAC;IAC9C,gBAAgB,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;QAC3D,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1C,GAAG,GAAG,GAAG,CAAC;YACV,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/profiles/modal-frame-axioms/formula.d.ts

@@ -0,0 +1,23 @@
+import { ModalFormula } from './types';
+declare function unary(f: ModalFormula): ModalFormula;
+declare function binLeft(f: ModalFormula): ModalFormula;
+declare function binRight(f: ModalFormula): ModalFormula;
+export declare const atom: (name: string) => ModalFormula;
+export declare const not: (arg: ModalFormula) => ModalFormula;
+export declare const and: (left: ModalFormula, right: ModalFormula) => ModalFormula;
+export declare const or: (left: ModalFormula, right: ModalFormula) => ModalFormula;
+export declare const implies: (left: ModalFormula, right: ModalFormula) => ModalFormula;
+export declare const box: (arg: ModalFormula) => ModalFormula;
+export declare const diamond: (arg: ModalFormula) => ModalFormula;
+/**
+ * Clave sintáctica determinista para deduplicación.
+ */
+export declare function formulaKey(f: ModalFormula): string;
+export declare function formulaEquals(a: ModalFormula, b: ModalFormula): boolean;
+export declare function formulaToString(f: ModalFormula): string;
+export declare function collectAtoms(f: ModalFormula, out?: Set<string>): Set<string>;
+export declare const subUnary: typeof unary;
+export declare const subLeft: typeof binLeft;
+export declare const subRight: typeof binRight;
+export {};
+//# sourceMappingURL=formula.d.ts.map

package/dist/profiles/modal-frame-axioms/formula.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"formula.d.ts","sourceRoot":"","sources":["../../../src/profiles/modal-frame-axioms/formula.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAMvC,iBAAS,KAAK,CAAC,CAAC,EAAE,YAAY,GAAG,YAAY,CAI5C;AAED,iBAAS,OAAO,CAAC,CAAC,EAAE,YAAY,GAAG,YAAY,CAI9C;AAED,iBAAS,QAAQ,CAAC,CAAC,EAAE,YAAY,GAAG,YAAY,CAI/C;AAMD,eAAO,MAAM,IAAI,GAAI,MAAM,MAAM,KAAG,YAAwC,CAAC;AAE7E,eAAO,MAAM,GAAG,GAAI,KAAK,YAAY,KAAG,YAAmD,CAAC;AAE5F,eAAO,MAAM,GAAG,GAAI,MAAM,YAAY,EAAE,OAAO,YAAY,KAAG,YAK5D,CAAC;AAEH,eAAO,MAAM,EAAE,GAAI,MAAM,YAAY,EAAE,OAAO,YAAY,KAAG,YAK3D,CAAC;AAEH,eAAO,MAAM,OAAO,GAAI,MAAM,YAAY,EAAE,OAAO,YAAY,KAAG,YAKhE,CAAC;AAEH,eAAO,MAAM,GAAG,GAAI,KAAK,YAAY,KAAG,YAAmD,CAAC;AAE5F,eAAO,MAAM,OAAO,GAAI,KAAK,YAAY,KAAG,YAI1C,CAAC;AAMH;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,YAAY,GAAG,MAAM,CAiBlD;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,OAAO,CAEvE;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,YAAY,GAAG,MAAM,CAoBvD;AAYD,wBAAgB,YAAY,CAAC,CAAC,EAAE,YAAY,EAAE,GAAG,GAAE,GAAG,CAAC,MAAM,CAAa,GAAG,GAAG,CAAC,MAAM,CAAC,CAevF;AAID,eAAO,MAAM,QAAQ,cAAQ,CAAC;AAC9B,eAAO,MAAM,OAAO,gBAAU,CAAC;AAC/B,eAAO,MAAM,QAAQ,iBAAW,CAAC"}

package/dist/profiles/modal-frame-axioms/formula.js

@@ -0,0 +1,158 @@
+"use strict";
+// ============================================================
+// Helpers de fórmulas modales
+// ============================================================
+//
+// La estructura {@link ModalFormula} admite tanto campos
+// específicos (`arg`, `left`, `right`) como un `args` n-ario para
+// flexibilidad. Aquí se normaliza el acceso: las funciones de
+// extracción aceptan ambos formatos y los constructores producen
+// la forma canónica con campos específicos (+ `args` espejo).
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.subRight = exports.subLeft = exports.subUnary = exports.diamond = exports.box = exports.implies = exports.or = exports.and = exports.not = exports.atom = void 0;
+exports.formulaKey = formulaKey;
+exports.formulaEquals = formulaEquals;
+exports.formulaToString = formulaToString;
+exports.collectAtoms = collectAtoms;
+// ------------------------------------------------------------
+// Acceso normalizado a subfórmulas
+// ------------------------------------------------------------
+function unary(f) {
+    if (f.arg)
+        return f.arg;
+    if (f.args && f.args[0])
+        return f.args[0];
+    throw new Error(`ModalFormula ${f.kind} sin subfórmula`);
+}
+function binLeft(f) {
+    if (f.left)
+        return f.left;
+    if (f.args && f.args[0])
+        return f.args[0];
+    throw new Error(`ModalFormula ${f.kind} sin lado izquierdo`);
+}
+function binRight(f) {
+    if (f.right)
+        return f.right;
+    if (f.args && f.args[1])
+        return f.args[1];
+    throw new Error(`ModalFormula ${f.kind} sin lado derecho`);
+}
+// ------------------------------------------------------------
+// Constructores ergonómicos
+// ------------------------------------------------------------
+const atom = (name) => ({ kind: 'atom', name });
+exports.atom = atom;
+const not = (arg) => ({ kind: 'not', arg, args: [arg] });
+exports.not = not;
+const and = (left, right) => ({
+    kind: 'and',
+    left,
+    right,
+    args: [left, right],
+});
+exports.and = and;
+const or = (left, right) => ({
+    kind: 'or',
+    left,
+    right,
+    args: [left, right],
+});
+exports.or = or;
+const implies = (left, right) => ({
+    kind: 'implies',
+    left,
+    right,
+    args: [left, right],
+});
+exports.implies = implies;
+const box = (arg) => ({ kind: 'box', arg, args: [arg] });
+exports.box = box;
+const diamond = (arg) => ({
+    kind: 'diamond',
+    arg,
+    args: [arg],
+});
+exports.diamond = diamond;
+// ------------------------------------------------------------
+// Clave / igualdad / representación
+// ------------------------------------------------------------
+/**
+ * Clave sintáctica determinista para deduplicación.
+ */
+function formulaKey(f) {
+    switch (f.kind) {
+        case 'atom':
+            return `A(${f.name ?? '?'})`;
+        case 'not':
+            return `N(${formulaKey(unary(f))})`;
+        case 'box':
+            return `B(${formulaKey(unary(f))})`;
+        case 'diamond':
+            return `D(${formulaKey(unary(f))})`;
+        case 'and':
+            return `&(${formulaKey(binLeft(f))},${formulaKey(binRight(f))})`;
+        case 'or':
+            return `|(${formulaKey(binLeft(f))},${formulaKey(binRight(f))})`;
+        case 'implies':
+            return `>(${formulaKey(binLeft(f))},${formulaKey(binRight(f))})`;
+    }
+}
+function formulaEquals(a, b) {
+    return formulaKey(a) === formulaKey(b);
+}
+function formulaToString(f) {
+    switch (f.kind) {
+        case 'atom':
+            return f.name ?? '?';
+        case 'not': {
+            const inner = unary(f);
+            if (inner.kind === 'atom')
+                return `¬${formulaToString(inner)}`;
+            return `¬(${formulaToString(inner)})`;
+        }
+        case 'box':
+            return `□${parens(unary(f))}`;
+        case 'diamond':
+            return `◇${parens(unary(f))}`;
+        case 'and':
+            return `(${formulaToString(binLeft(f))} ∧ ${formulaToString(binRight(f))})`;
+        case 'or':
+            return `(${formulaToString(binLeft(f))} ∨ ${formulaToString(binRight(f))})`;
+        case 'implies':
+            return `(${formulaToString(binLeft(f))} → ${formulaToString(binRight(f))})`;
+    }
+}
+function parens(f) {
+    if (f.kind === 'atom')
+        return formulaToString(f);
+    if (f.kind === 'box' || f.kind === 'diamond')
+        return formulaToString(f);
+    return `(${formulaToString(f)})`;
+}
+// ------------------------------------------------------------
+// Átomos
+// ------------------------------------------------------------
+function collectAtoms(f, out = new Set()) {
+    switch (f.kind) {
+        case 'atom':
+            if (f.name)
+                out.add(f.name);
+            return out;
+        case 'not':
+        case 'box':
+        case 'diamond':
+            return collectAtoms(unary(f), out);
+        case 'and':
+        case 'or':
+        case 'implies':
+            collectAtoms(binLeft(f), out);
+            return collectAtoms(binRight(f), out);
+    }
+}
+// Acceso público a las extracciones normalizadas (útil para
+// el motor de tableau y tests).
+exports.subUnary = unary;
+exports.subLeft = binLeft;
+exports.subRight = binRight;
+//# sourceMappingURL=formula.js.map

package/dist/profiles/modal-frame-axioms/formula.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"formula.js","sourceRoot":"","sources":["../../../src/profiles/modal-frame-axioms/formula.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,8BAA8B;AAC9B,+DAA+D;AAC/D,EAAE;AACF,yDAAyD;AACzD,kEAAkE;AAClE,8DAA8D;AAC9D,iEAAiE;AACjE,8DAA8D;;;AAsE9D,gCAiBC;AAED,sCAEC;AAED,0CAoBC;AAYD,oCAeC;AAxID,+DAA+D;AAC/D,mCAAmC;AACnC,+DAA+D;AAE/D,SAAS,KAAK,CAAC,CAAe;IAC5B,IAAI,CAAC,CAAC,GAAG;QAAE,OAAO,CAAC,CAAC,GAAG,CAAC;IACxB,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC,IAAI,iBAAiB,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,OAAO,CAAC,CAAe;IAC9B,IAAI,CAAC,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC,IAAI,CAAC;IAC1B,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC,IAAI,qBAAqB,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,QAAQ,CAAC,CAAe;IAC/B,IAAI,CAAC,CAAC,KAAK;QAAE,OAAO,CAAC,CAAC,KAAK,CAAC;IAC5B,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC,IAAI,mBAAmB,CAAC,CAAC;AAC7D,CAAC;AAED,+DAA+D;AAC/D,4BAA4B;AAC5B,+DAA+D;AAExD,MAAM,IAAI,GAAG,CAAC,IAAY,EAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAAhE,QAAA,IAAI,QAA4D;AAEtE,MAAM,GAAG,GAAG,CAAC,GAAiB,EAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAA/E,QAAA,GAAG,OAA4E;AAErF,MAAM,GAAG,GAAG,CAAC,IAAkB,EAAE,KAAmB,EAAgB,EAAE,CAAC,CAAC;IAC7E,IAAI,EAAE,KAAK;IACX,IAAI;IACJ,KAAK;IACL,IAAI,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC;CACpB,CAAC,CAAC;AALU,QAAA,GAAG,OAKb;AAEI,MAAM,EAAE,GAAG,CAAC,IAAkB,EAAE,KAAmB,EAAgB,EAAE,CAAC,CAAC;IAC5E,IAAI,EAAE,IAAI;IACV,IAAI;IACJ,KAAK;IACL,IAAI,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC;CACpB,CAAC,CAAC;AALU,QAAA,EAAE,MAKZ;AAEI,MAAM,OAAO,GAAG,CAAC,IAAkB,EAAE,KAAmB,EAAgB,EAAE,CAAC,CAAC;IACjF,IAAI,EAAE,SAAS;IACf,IAAI;IACJ,KAAK;IACL,IAAI,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC;CACpB,CAAC,CAAC;AALU,QAAA,OAAO,WAKjB;AAEI,MAAM,GAAG,GAAG,CAAC,GAAiB,EAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAA/E,QAAA,GAAG,OAA4E;AAErF,MAAM,OAAO,GAAG,CAAC,GAAiB,EAAgB,EAAE,CAAC,CAAC;IAC3D,IAAI,EAAE,SAAS;IACf,GAAG;IACH,IAAI,EAAE,CAAC,GAAG,CAAC;CACZ,CAAC,CAAC;AAJU,QAAA,OAAO,WAIjB;AAEH,+DAA+D;AAC/D,oCAAoC;AACpC,+DAA+D;AAE/D;;GAEG;AACH,SAAgB,UAAU,CAAC,CAAe;IACxC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,KAAK,CAAC,CAAC,IAAI,IAAI,GAAG,GAAG,CAAC;QAC/B,KAAK,KAAK;YACR,OAAO,KAAK,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACtC,KAAK,KAAK;YACR,OAAO,KAAK,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACtC,KAAK,SAAS;YACZ,OAAO,KAAK,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACtC,KAAK,KAAK;YACR,OAAO,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACnE,KAAK,IAAI;YACP,OAAO,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACnE,KAAK,SAAS;YACZ,OAAO,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IACrE,CAAC;AACH,CAAC;AAED,SAAgB,aAAa,CAAC,CAAe,EAAE,CAAe;IAC5D,OAAO,UAAU,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,SAAgB,eAAe,CAAC,CAAe;IAC7C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC;QACvB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/D,OAAO,KAAK,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC;QACxC,CAAC;QACD,KAAK,KAAK;YACR,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAChC,KAAK,SAAS;YACZ,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAChC,KAAK,KAAK;YACR,OAAO,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC9E,KAAK,IAAI;YACP,OAAO,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC9E,KAAK,SAAS;YACZ,OAAO,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAChF,CAAC;AACH,CAAC;AAED,SAAS,MAAM,CAAC,CAAe;IAC7B,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,eAAe,CAAC,CAAC,CAAC,CAAC;IACjD,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,eAAe,CAAC,CAAC,CAAC,CAAC;IACxE,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC;AACnC,CAAC;AAED,+DAA+D;AAC/D,SAAS;AACT,+DAA+D;AAE/D,SAAgB,YAAY,CAAC,CAAe,EAAE,MAAmB,IAAI,GAAG,EAAE;IACxE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,IAAI,CAAC,CAAC,IAAI;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,OAAO,GAAG,CAAC;QACb,KAAK,KAAK,CAAC;QACX,KAAK,KAAK,CAAC;QACX,KAAK,SAAS;YACZ,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACrC,KAAK,KAAK,CAAC;QACX,KAAK,IAAI,CAAC;QACV,KAAK,SAAS;YACZ,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC9B,OAAO,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC1C,CAAC;AACH,CAAC;AAED,4DAA4D;AAC5D,gCAAgC;AACnB,QAAA,QAAQ,GAAG,KAAK,CAAC;AACjB,QAAA,OAAO,GAAG,OAAO,CAAC;AAClB,QAAA,QAAQ,GAAG,QAAQ,CAAC"}

package/dist/profiles/modal-frame-axioms/index.d.ts

@@ -0,0 +1,6 @@
+export type { FrameAxiom, ModalSystem, ModalFormula, KripkeModel, TableauResult } from './types';
+export { atom, not, and, or, implies, box, diamond, formulaKey, formulaEquals, formulaToString, collectAtoms, } from './formula';
+export { tableauWithAxioms } from './tableau';
+export type { TableauOptions } from './tableau';
+export { systemAxioms, isSatisfiable, isValid, axiomFormula } from './systems';
+//# sourceMappingURL=index.d.ts.map

package/dist/profiles/modal-frame-axioms/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/profiles/modal-frame-axioms/index.ts"],"names":[],"mappings":"AAmBA,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAEjG,OAAO,EACL,IAAI,EACJ,GAAG,EACH,GAAG,EACH,EAAE,EACF,OAAO,EACP,GAAG,EACH,OAAO,EACP,UAAU,EACV,aAAa,EACb,eAAe,EACf,YAAY,GACb,MAAM,WAAW,CAAC;AAEnB,OAAO,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAC9C,YAAY,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAEhD,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC"}

package/dist/profiles/modal-frame-axioms/index.js

@@ -0,0 +1,41 @@
+"use strict";
+// ============================================================
+// Modal Frame Axioms — Entrada pública
+// ============================================================
+//
+// Tableau modal extendido con axiomas de frame (T, B, 4, 5, D)
+// y composición de sistemas estándar (K, T, D, B, S4, S5, KD45...).
+//
+// Uso típico:
+//
+//   import {
+//     atom, box, diamond, implies,
+//     isValid, isSatisfiable, tableauWithAxioms,
+//   } from '@stevenvo780/st-lang/profiles/modal-frame-axioms';
+//
+//   const p = atom('p');
+//   isValid(implies(box(p), p), 'T');      // true
+//   isValid(implies(box(p), p), 'K');      // false
+//   isValid(implies(box(p), box(box(p))), 'S4'); // true
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.axiomFormula = exports.isValid = exports.isSatisfiable = exports.systemAxioms = exports.tableauWithAxioms = exports.collectAtoms = exports.formulaToString = exports.formulaEquals = exports.formulaKey = exports.diamond = exports.box = exports.implies = exports.or = exports.and = exports.not = exports.atom = void 0;
+var formula_1 = require("./formula");
+Object.defineProperty(exports, "atom", { enumerable: true, get: function () { return formula_1.atom; } });
+Object.defineProperty(exports, "not", { enumerable: true, get: function () { return formula_1.not; } });
+Object.defineProperty(exports, "and", { enumerable: true, get: function () { return formula_1.and; } });
+Object.defineProperty(exports, "or", { enumerable: true, get: function () { return formula_1.or; } });
+Object.defineProperty(exports, "implies", { enumerable: true, get: function () { return formula_1.implies; } });
+Object.defineProperty(exports, "box", { enumerable: true, get: function () { return formula_1.box; } });
+Object.defineProperty(exports, "diamond", { enumerable: true, get: function () { return formula_1.diamond; } });
+Object.defineProperty(exports, "formulaKey", { enumerable: true, get: function () { return formula_1.formulaKey; } });
+Object.defineProperty(exports, "formulaEquals", { enumerable: true, get: function () { return formula_1.formulaEquals; } });
+Object.defineProperty(exports, "formulaToString", { enumerable: true, get: function () { return formula_1.formulaToString; } });
+Object.defineProperty(exports, "collectAtoms", { enumerable: true, get: function () { return formula_1.collectAtoms; } });
+var tableau_1 = require("./tableau");
+Object.defineProperty(exports, "tableauWithAxioms", { enumerable: true, get: function () { return tableau_1.tableauWithAxioms; } });
+var systems_1 = require("./systems");
+Object.defineProperty(exports, "systemAxioms", { enumerable: true, get: function () { return systems_1.systemAxioms; } });
+Object.defineProperty(exports, "isSatisfiable", { enumerable: true, get: function () { return systems_1.isSatisfiable; } });
+Object.defineProperty(exports, "isValid", { enumerable: true, get: function () { return systems_1.isValid; } });
+Object.defineProperty(exports, "axiomFormula", { enumerable: true, get: function () { return systems_1.axiomFormula; } });
+//# sourceMappingURL=index.js.map

package/dist/profiles/modal-frame-axioms/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/modal-frame-axioms/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uCAAuC;AACvC,+DAA+D;AAC/D,EAAE;AACF,+DAA+D;AAC/D,oEAAoE;AACpE,EAAE;AACF,cAAc;AACd,EAAE;AACF,aAAa;AACb,mCAAmC;AACnC,iDAAiD;AACjD,+DAA+D;AAC/D,EAAE;AACF,yBAAyB;AACzB,mDAAmD;AACnD,oDAAoD;AACpD,yDAAyD;;;AAIzD,qCAYmB;AAXjB,+FAAA,IAAI,OAAA;AACJ,8FAAA,GAAG,OAAA;AACH,8FAAA,GAAG,OAAA;AACH,6FAAA,EAAE,OAAA;AACF,kGAAA,OAAO,OAAA;AACP,8FAAA,GAAG,OAAA;AACH,kGAAA,OAAO,OAAA;AACP,qGAAA,UAAU,OAAA;AACV,wGAAA,aAAa,OAAA;AACb,0GAAA,eAAe,OAAA;AACf,uGAAA,YAAY,OAAA;AAGd,qCAA8C;AAArC,4GAAA,iBAAiB,OAAA;AAG1B,qCAA+E;AAAtE,uGAAA,YAAY,OAAA;AAAE,wGAAA,aAAa,OAAA;AAAE,kGAAA,OAAO,OAAA;AAAE,uGAAA,YAAY,OAAA"}

package/dist/profiles/modal-frame-axioms/systems.d.ts

@@ -0,0 +1,29 @@
+import { FrameAxiom, ModalFormula, ModalSystem } from './types';
+/**
+ * Devuelve los axiomas que caracterizan al sistema nombrado.
+ *
+ * Para sistemas no listados (e.g. "K45", "KTB5") usar directamente
+ * {@link tableauWithAxioms} con la combinación deseada.
+ */
+export declare function systemAxioms(system: ModalSystem): FrameAxiom[];
+/**
+ * ¿`phi` es satisfacible en el sistema `system`?
+ *
+ * Equivale a: ¿existe un modelo Kripke cuyo frame cumple los
+ * axiomas y cuya raíz fuerza `phi`?
+ */
+export declare function isSatisfiable(phi: ModalFormula, system: ModalSystem): boolean;
+/**
+ * ¿`phi` es válida en el sistema `system`?
+ *
+ * Equivale a: ¬(¬phi satisfacible) — si el tableau de ¬φ cierra
+ * en todas las ramas, φ es teorema del sistema.
+ */
+export declare function isValid(phi: ModalFormula, system: ModalSystem): boolean;
+/**
+ * Esquema del axioma como fórmula concreta sobre un átomo dado.
+ * Útil para verificar que cada axioma es válido en su sistema
+ * mínimo.
+ */
+export declare function axiomFormula(axiom: FrameAxiom, p: ModalFormula): ModalFormula;
+//# sourceMappingURL=systems.d.ts.map

package/dist/profiles/modal-frame-axioms/systems.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"systems.d.ts","sourceRoot":"","sources":["../../../src/profiles/modal-frame-axioms/systems.ts"],"names":[],"mappings":"AAoBA,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAEhE;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,WAAW,GAAG,UAAU,EAAE,CAuB9D;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,YAAY,EAAE,MAAM,EAAE,WAAW,GAAG,OAAO,CAE7E;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,GAAG,EAAE,YAAY,EAAE,MAAM,EAAE,WAAW,GAAG,OAAO,CAEvE;AAMD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,YAAY,GAAG,YAAY,CAa7E"}

package/dist/profiles/modal-frame-axioms/systems.js

@@ -0,0 +1,96 @@
+"use strict";
+// ============================================================
+// Sistemas modales nombrados — composición de axiomas
+// ============================================================
+//
+// Mapa de etiquetas estándar a sus axiomas. Los sistemas se
+// caracterizan por la relación de accesibilidad del frame:
+//
+//   K     ∅                  — sin restricción
+//   T     reflexiva          — {T}
+//   D     serial             — {D}
+//   KB    simétrica          — {B}
+//   K4    transitiva         — {4}
+//   K5    euclidiana         — {5}
+//   B     refl + sim         — {T, B}    (a veces "KTB")
+//   S4    refl + trans       — {T, 4}
+//   S5    equivalencia       — {T, 4, 5} (≡ {T, B, 4})
+//   KD45  ser + trans + eucl — {D, 4, 5} (lógica doxástica)
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.systemAxioms = systemAxioms;
+exports.isSatisfiable = isSatisfiable;
+exports.isValid = isValid;
+exports.axiomFormula = axiomFormula;
+const formula_1 = require("./formula");
+const tableau_1 = require("./tableau");
+/**
+ * Devuelve los axiomas que caracterizan al sistema nombrado.
+ *
+ * Para sistemas no listados (e.g. "K45", "KTB5") usar directamente
+ * {@link tableauWithAxioms} con la combinación deseada.
+ */
+function systemAxioms(system) {
+    switch (system) {
+        case 'K':
+            return [];
+        case 'T':
+            return ['T'];
+        case 'D':
+            return ['D'];
+        case 'KB':
+            return ['B'];
+        case 'K4':
+            return ['4'];
+        case 'K5':
+            return ['5'];
+        case 'B':
+            return ['T', 'B'];
+        case 'S4':
+            return ['T', '4'];
+        case 'S5':
+            return ['T', '4', '5'];
+        case 'KD45':
+            return ['D', '4', '5'];
+    }
+}
+/**
+ * ¿`phi` es satisfacible en el sistema `system`?
+ *
+ * Equivale a: ¿existe un modelo Kripke cuyo frame cumple los
+ * axiomas y cuya raíz fuerza `phi`?
+ */
+function isSatisfiable(phi, system) {
+    return (0, tableau_1.tableauWithAxioms)(phi, systemAxioms(system)).sat;
+}
+/**
+ * ¿`phi` es válida en el sistema `system`?
+ *
+ * Equivale a: ¬(¬phi satisfacible) — si el tableau de ¬φ cierra
+ * en todas las ramas, φ es teorema del sistema.
+ */
+function isValid(phi, system) {
+    return !isSatisfiable((0, formula_1.not)(phi), system);
+}
+// ------------------------------------------------------------
+// Helpers: axiomas como fórmulas (útil para tests)
+// ------------------------------------------------------------
+/**
+ * Esquema del axioma como fórmula concreta sobre un átomo dado.
+ * Útil para verificar que cada axioma es válido en su sistema
+ * mínimo.
+ */
+function axiomFormula(axiom, p) {
+    switch (axiom) {
+        case 'T':
+            return (0, formula_1.implies)((0, formula_1.box)(p), p);
+        case 'B':
+            return (0, formula_1.implies)(p, (0, formula_1.box)((0, formula_1.diamond)(p)));
+        case '4':
+            return (0, formula_1.implies)((0, formula_1.box)(p), (0, formula_1.box)((0, formula_1.box)(p)));
+        case '5':
+            return (0, formula_1.implies)((0, formula_1.diamond)(p), (0, formula_1.box)((0, formula_1.diamond)(p)));
+        case 'D':
+            return (0, formula_1.implies)((0, formula_1.box)(p), (0, formula_1.diamond)(p));
+    }
+}
+//# sourceMappingURL=systems.js.map

package/dist/profiles/modal-frame-axioms/systems.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"systems.js","sourceRoot":"","sources":["../../../src/profiles/modal-frame-axioms/systems.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sDAAsD;AACtD,+DAA+D;AAC/D,EAAE;AACF,4DAA4D;AAC5D,2DAA2D;AAC3D,EAAE;AACF,+CAA+C;AAC/C,mCAAmC;AACnC,mCAAmC;AACnC,mCAAmC;AACnC,mCAAmC;AACnC,mCAAmC;AACnC,yDAAyD;AACzD,sCAAsC;AACtC,uDAAuD;AACvD,4DAA4D;;AAY5D,oCAuBC;AAQD,sCAEC;AAQD,0BAEC;AAWD,oCAaC;AA7ED,uCAAuD;AACvD,uCAA8C;AAG9C;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,MAAmB;IAC9C,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,GAAG;YACN,OAAO,EAAE,CAAC;QACZ,KAAK,GAAG;YACN,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,KAAK,GAAG;YACN,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,KAAK,IAAI;YACP,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,KAAK,IAAI;YACP,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,KAAK,IAAI;YACP,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,KAAK,GAAG;YACN,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI;YACP,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI;YACP,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,KAAK,MAAM;YACT,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3B,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAgB,aAAa,CAAC,GAAiB,EAAE,MAAmB;IAClE,OAAO,IAAA,2BAAiB,EAAC,GAAG,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;AAC1D,CAAC;AAED;;;;;GAKG;AACH,SAAgB,OAAO,CAAC,GAAiB,EAAE,MAAmB;IAC5D,OAAO,CAAC,aAAa,CAAC,IAAA,aAAG,EAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;AAC1C,CAAC;AAED,+DAA+D;AAC/D,mDAAmD;AACnD,+DAA+D;AAE/D;;;;GAIG;AACH,SAAgB,YAAY,CAAC,KAAiB,EAAE,CAAe;IAC7D,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,GAAG;YACN,OAAO,IAAA,iBAAO,EAAC,IAAA,aAAG,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,KAAK,GAAG;YACN,OAAO,IAAA,iBAAO,EAAC,CAAC,EAAE,IAAA,aAAG,EAAC,IAAA,iBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,KAAK,GAAG;YACN,OAAO,IAAA,iBAAO,EAAC,IAAA,aAAG,EAAC,CAAC,CAAC,EAAE,IAAA,aAAG,EAAC,IAAA,aAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,KAAK,GAAG;YACN,OAAO,IAAA,iBAAO,EAAC,IAAA,iBAAO,EAAC,CAAC,CAAC,EAAE,IAAA,aAAG,EAAC,IAAA,iBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,KAAK,GAAG;YACN,OAAO,IAAA,iBAAO,EAAC,IAAA,aAAG,EAAC,CAAC,CAAC,EAAE,IAAA,iBAAO,EAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;AACH,CAAC"}