@stevenvo780/st-lang 4.2.0 → 4.3.0

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

@@ -0,0 +1,12 @@
+import { FrameAxiom, ModalFormula, TableauResult } from './types';
+export interface TableauOptions {
+    /** Máximo número de mundos a explorar. Default heurístico. */
+    maxWorlds?: number;
+}
+/**
+ * Construye un tableau extendido para `phi` bajo los axiomas
+ * de frame `axioms`. Devuelve `sat` con un modelo si existe; en
+ * caso contrario `closed=true`.
+ */
+export declare function tableauWithAxioms(phi: ModalFormula, axioms: FrameAxiom[], options?: TableauOptions): TableauResult;
+//# sourceMappingURL=tableau.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"tableau.d.ts","sourceRoot":"","sources":["../../../src/profiles/modal-frame-axioms/tableau.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAE,UAAU,EAAe,YAAY,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AA4R/E,MAAM,WAAW,cAAc;IAC7B,8DAA8D;IAC9D,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,YAAY,EACjB,MAAM,EAAE,UAAU,EAAE,EACpB,OAAO,GAAE,cAAmB,GAC3B,aAAa,CAoBf"}

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

@@ -0,0 +1,299 @@
+"use strict";
+// ============================================================
+// Tableau extendido con axiomas de frame (T, B, 4, 5, D)
+// ============================================================
+//
+// Estrategia: enumeración acotada de modelos Kripke finitos que
+// satisfacen las condiciones de frame impuestas por los axiomas
+// elegidos. Toda lógica modal normal definida por un subconjunto
+// de {T, B, 4, 5, D} tiene la propiedad del modelo finito (FMP),
+// así que la búsqueda bounded es completa para tamaños suficientes.
+//
+// El nombre "tableau" se mantiene por la interfaz pública: el
+// procedimiento es equivalente a saturar un tableau prefijado y
+// extraer un Kripke model de la rama abierta, sólo que aquí se
+// hace por enumeración directa de frames + valuaciones — más
+// simple de auditar y más rápido para |sub(φ)| pequeño.
+//
+// Para evitar explosión combinatoria:
+//   - El tamaño del frame se elige según |sub(φ)| y los axiomas.
+//   - Se aplica clausura del frame antes de evaluar para
+//     enforce de las condiciones (transitivo, simétrico, etc.).
+//   - Las valuaciones se enumeran sólo sobre átomos que aparecen.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.tableauWithAxioms = tableauWithAxioms;
+const formula_1 = require("./formula");
+function edgeKey(size, from, to) {
+    return from * size + to;
+}
+function hasEdge(m, from, to) {
+    return m.edges.has(edgeKey(m.size, from, to));
+}
+function successors(m, w) {
+    const out = [];
+    for (let v = 0; v < m.size; v++) {
+        if (hasEdge(m, w, v))
+            out.push(v);
+    }
+    return out;
+}
+// ------------------------------------------------------------
+// Forcing modal estándar (semántica Kripke)
+// ------------------------------------------------------------
+function forces(m, w, f) {
+    switch (f.kind) {
+        case 'atom':
+            return f.name !== undefined && m.val[w].has(f.name);
+        case 'not':
+            return !forces(m, w, (0, formula_1.subUnary)(f));
+        case 'and':
+            return forces(m, w, (0, formula_1.subLeft)(f)) && forces(m, w, (0, formula_1.subRight)(f));
+        case 'or':
+            return forces(m, w, (0, formula_1.subLeft)(f)) || forces(m, w, (0, formula_1.subRight)(f));
+        case 'implies':
+            return !forces(m, w, (0, formula_1.subLeft)(f)) || forces(m, w, (0, formula_1.subRight)(f));
+        case 'box': {
+            const inner = (0, formula_1.subUnary)(f);
+            for (const v of successors(m, w)) {
+                if (!forces(m, v, inner))
+                    return false;
+            }
+            return true;
+        }
+        case 'diamond': {
+            const inner = (0, formula_1.subUnary)(f);
+            for (const v of successors(m, w)) {
+                if (forces(m, v, inner))
+                    return true;
+            }
+            return false;
+        }
+    }
+}
+// ------------------------------------------------------------
+// Aplicación de axiomas de frame — clausura sobre las aristas
+// ------------------------------------------------------------
+/**
+ * Aplica las condiciones de frame impuestas por los axiomas
+ * IN-PLACE sobre `edges`. Devuelve `false` si el frame no puede
+ * satisfacer las condiciones (e.g. D requiere serialidad y el
+ * mundo está aislado — se intentará añadir, pero el chequeo
+ * final lo confirma).
+ *
+ * Reglas:
+ *   - T : ∀w. R(w,w)          → añadir lazos.
+ *   - B : R(w,v) → R(v,w)     → simetrizar.
+ *   - 4 : transitividad        → cerrar transitivamente.
+ *   - 5 : R(w,v)∧R(w,u)→R(v,u) → euclidianizar.
+ *   - D : ∀w. ∃v. R(w,v)       → si w sin sucesor, añadir lazo
+ *                                a w (siempre coherente con K+D).
+ *
+ * Las clausuras (B, 4, 5) se iteran hasta punto fijo porque se
+ * generan mutuamente.
+ */
+function closeFrame(model, axioms) {
+    const size = model.size;
+    if (axioms.has('T')) {
+        for (let w = 0; w < size; w++) {
+            model.edges.add(edgeKey(size, w, w));
+        }
+    }
+    let changed = true;
+    while (changed) {
+        changed = false;
+        if (axioms.has('B')) {
+            const snapshot = [...model.edges];
+            for (const k of snapshot) {
+                const from = Math.floor(k / size);
+                const to = k % size;
+                const rev = edgeKey(size, to, from);
+                if (!model.edges.has(rev)) {
+                    model.edges.add(rev);
+                    changed = true;
+                }
+            }
+        }
+        if (axioms.has('4')) {
+            // Cierre transitivo (Floyd-Warshall sobre la matriz booleana)
+            for (let k = 0; k < size; k++) {
+                for (let i = 0; i < size; i++) {
+                    if (!hasEdge(model, i, k))
+                        continue;
+                    for (let j = 0; j < size; j++) {
+                        if (hasEdge(model, k, j) && !hasEdge(model, i, j)) {
+                            model.edges.add(edgeKey(size, i, j));
+                            changed = true;
+                        }
+                    }
+                }
+            }
+        }
+        if (axioms.has('5')) {
+            // Euclidianidad: si w R v y w R u entonces v R u.
+            for (let w = 0; w < size; w++) {
+                const succs = [];
+                for (let v = 0; v < size; v++) {
+                    if (hasEdge(model, w, v))
+                        succs.push(v);
+                }
+                for (const v of succs) {
+                    for (const u of succs) {
+                        if (!hasEdge(model, v, u)) {
+                            model.edges.add(edgeKey(size, v, u));
+                            changed = true;
+                        }
+                    }
+                }
+            }
+        }
+    }
+    if (axioms.has('D')) {
+        // Serialidad: cada mundo necesita ≥1 sucesor. Si falta, lo
+        // damos como auto-lazo (coherente con D, pero no añade T
+        // a otros mundos).
+        for (let w = 0; w < size; w++) {
+            let has = false;
+            for (let v = 0; v < size; v++) {
+                if (hasEdge(model, w, v)) {
+                    has = true;
+                    break;
+                }
+            }
+            if (!has) {
+                model.edges.add(edgeKey(size, w, w));
+            }
+        }
+        // Cerrar de nuevo simetría/transitividad/euclidiana si las
+        // nuevas aristas introducen requerimientos.
+        if (axioms.has('B') || axioms.has('4') || axioms.has('5')) {
+            closeFrame(model, new Set([...axioms].filter((a) => a !== 'D')));
+        }
+    }
+}
+// ------------------------------------------------------------
+// Enumeración de frames y valuaciones
+// ------------------------------------------------------------
+/**
+ * Genera todos los frames de tamaño `size`. Para cada uno
+ * aplica la clausura del axioma y descarta duplicados sintácticos
+ * post-clausura.
+ */
+function* generateFrames(size, axioms) {
+    const pairs = [];
+    for (let i = 0; i < size; i++) {
+        for (let j = 0; j < size; j++) {
+            // Si T está activo, todos los lazos están forzados — no
+            // los enumeramos como variables libres.
+            if (axioms.has('T') && i === j)
+                continue;
+            pairs.push([i, j]);
+        }
+    }
+    const total = 1 << pairs.length;
+    const seen = new Set();
+    for (let mask = 0; mask < total; mask++) {
+        const edges = new Set();
+        for (let b = 0; b < pairs.length; b++) {
+            if (mask & (1 << b)) {
+                const [from, to] = pairs[b];
+                edges.add(edgeKey(size, from, to));
+            }
+        }
+        const model = {
+            size,
+            edges,
+            val: Array.from({ length: size }, () => new Set()),
+        };
+        closeFrame(model, axioms);
+        const sig = [...model.edges].sort((a, b) => a - b).join(',');
+        if (seen.has(sig))
+            continue;
+        seen.add(sig);
+        yield model;
+    }
+}
+/**
+ * Enumera valuaciones sobre `atoms` para los `size` mundos
+ * (subconjunto arbitrario de átomos por mundo, sin restricción
+ * de monotonía — la lógica modal estándar no la exige).
+ */
+function* generateValuations(size, atoms) {
+    const k = atoms.length;
+    const perWorld = 1 << k;
+    const total = Math.pow(perWorld, size);
+    for (let i = 0; i < total; i++) {
+        const val = [];
+        let idx = i;
+        for (let w = 0; w < size; w++) {
+            const mask = idx % perWorld;
+            idx = Math.floor(idx / perWorld);
+            const set = new Set();
+            for (let a = 0; a < k; a++) {
+                if (mask & (1 << a))
+                    set.add(atoms[a]);
+            }
+            val.push(set);
+        }
+        yield val;
+    }
+}
+// ------------------------------------------------------------
+// Cota de tamaño de modelo
+// ------------------------------------------------------------
+/**
+ * Tamaño máximo de modelo a explorar. Conservador: 2^|atoms|+1
+ * bastaría para la propiedad de filtración en muchas lógicas,
+ * pero acotado por un máximo absoluto para evitar explosiones.
+ *
+ * Override vía `options.maxWorlds` en la API pública.
+ */
+function defaultMaxWorlds(atomCount) {
+    if (atomCount <= 1)
+        return 3;
+    if (atomCount <= 2)
+        return 3;
+    return 3;
+}
+// ------------------------------------------------------------
+// Conversión modelo interno → público
+// ------------------------------------------------------------
+function toPublic(model, actual) {
+    const worlds = Array.from({ length: model.size }, (_, i) => `w${i}`);
+    const accessibility = [];
+    for (const k of model.edges) {
+        const from = Math.floor(k / model.size);
+        const to = k % model.size;
+        accessibility.push([`w${from}`, `w${to}`]);
+    }
+    accessibility.sort((a, b) => a[0] === b[0] ? a[1].localeCompare(b[1]) : a[0].localeCompare(b[0]));
+    const valuation = new Map();
+    for (let w = 0; w < model.size; w++) {
+        valuation.set(`w${w}`, new Set(model.val[w]));
+    }
+    return { worlds, accessibility, valuation, actual: `w${actual}` };
+}
+/**
+ * Construye un tableau extendido para `phi` bajo los axiomas
+ * de frame `axioms`. Devuelve `sat` con un modelo si existe; en
+ * caso contrario `closed=true`.
+ */
+function tableauWithAxioms(phi, axioms, options = {}) {
+    const axiomSet = new Set(axioms);
+    const atoms = [...(0, formula_1.collectAtoms)(phi)];
+    // Si la fórmula no menciona átomos (e.g. □⊥ con notación
+    // sintética), igual hay que considerar valuaciones triviales.
+    const effectiveAtoms = atoms.length === 0 ? [] : atoms;
+    const maxWorlds = options.maxWorlds ?? defaultMaxWorlds(effectiveAtoms.length);
+    for (let size = 1; size <= maxWorlds; size++) {
+        for (const frame of generateFrames(size, axiomSet)) {
+            for (const val of generateValuations(size, effectiveAtoms)) {
+                frame.val = val;
+                if (forces(frame, 0, phi)) {
+                    return { sat: true, closed: false, model: toPublic(frame, 0) };
+                }
+            }
+        }
+    }
+    return { sat: false, closed: true };
+}
+//# sourceMappingURL=tableau.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"tableau.js","sourceRoot":"","sources":["../../../src/profiles/modal-frame-axioms/tableau.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yDAAyD;AACzD,+DAA+D;AAC/D,EAAE;AACF,gEAAgE;AAChE,gEAAgE;AAChE,iEAAiE;AACjE,iEAAiE;AACjE,oEAAoE;AACpE,EAAE;AACF,8DAA8D;AAC9D,gEAAgE;AAChE,+DAA+D;AAC/D,6DAA6D;AAC7D,wDAAwD;AACxD,EAAE;AACF,sCAAsC;AACtC,iEAAiE;AACjE,yDAAyD;AACzD,gEAAgE;AAChE,kEAAkE;;AAwSlE,8CAwBC;AA7TD,uCAAsE;AActE,SAAS,OAAO,CAAC,IAAY,EAAE,IAAY,EAAE,EAAU;IACrD,OAAO,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;AAC1B,CAAC;AAED,SAAS,OAAO,CAAC,CAAgB,EAAE,IAAY,EAAE,EAAU;IACzD,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,SAAS,UAAU,CAAC,CAAgB,EAAE,CAAS;IAC7C,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+DAA+D;AAC/D,4CAA4C;AAC5C,+DAA+D;AAE/D,SAAS,MAAM,CAAC,CAAgB,EAAE,CAAS,EAAE,CAAe;IAC1D,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACtD,KAAK,KAAK;YACR,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC;QACpC,KAAK,KAAK;YACR,OAAO,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAA,iBAAO,EAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,KAAK,IAAI;YACP,OAAO,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAA,iBAAO,EAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,KAAK,SAAS;YACZ,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAA,iBAAO,EAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC;QAChE,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC;YAC1B,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACjC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;YACzC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,KAAK,GAAG,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC;YAC1B,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACjC,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC;YACvC,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,8DAA8D;AAC9D,+DAA+D;AAE/D;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAS,UAAU,CAAC,KAAoB,EAAE,MAAuB;IAC/D,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;IAExB,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAEhB,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAClC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;gBAClC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;gBACpB,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;gBACpC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC1B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACrB,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,8DAA8D;YAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9B,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;wBAAE,SAAS;oBACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC9B,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;4BAClD,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;4BACrC,OAAO,GAAG,IAAI,CAAC;wBACjB,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,kDAAkD;YAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,KAAK,GAAa,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9B,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;wBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC1C,CAAC;gBACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;oBACtB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;wBACtB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;4BAC1B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;4BACrC,OAAO,GAAG,IAAI,CAAC;wBACjB,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACpB,2DAA2D;QAC3D,yDAAyD;QACzD,mBAAmB;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,GAAG,GAAG,KAAK,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACzB,GAAG,GAAG,IAAI,CAAC;oBACX,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QACD,2DAA2D;QAC3D,4CAA4C;QAC5C,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1D,UAAU,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,sCAAsC;AACtC,+DAA+D;AAE/D;;;;GAIG;AACH,QAAQ,CAAC,CAAC,cAAc,CAAC,IAAY,EAAE,MAAuB;IAC5D,MAAM,KAAK,GAA4B,EAAE,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,wDAAwD;YACxD,wCAAwC;YACxC,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YACzC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5B,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QACD,MAAM,KAAK,GAAkB;YAC3B,IAAI;YACJ,KAAK;YACL,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,GAAG,EAAU,CAAC;SAC3D,CAAC;QACF,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAE1B,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7D,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEd,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,QAAQ,CAAC,CAAC,kBAAkB,CAAC,IAAY,EAAE,KAAe;IACxD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC;IACxB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAkB,EAAE,CAAC;QAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,GAAG,GAAG,QAAQ,CAAC;YAC5B,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC;YACjC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;oBAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,2BAA2B;AAC3B,+DAA+D;AAE/D;;;;;;GAMG;AACH,SAAS,gBAAgB,CAAC,SAAiB;IACzC,IAAI,SAAS,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC7B,IAAI,SAAS,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC7B,OAAO,CAAC,CAAC;AACX,CAAC;AAED,+DAA+D;AAC/D,sCAAsC;AACtC,+DAA+D;AAE/D,SAAS,QAAQ,CAAC,KAAoB,EAAE,MAAc;IACpD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrE,MAAM,aAAa,GAA4B,EAAE,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;QAC1B,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC1B,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACpE,CAAC;IACF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,MAAM,EAAE,EAAE,CAAC;AACpE,CAAC;AAWD;;;;GAIG;AACH,SAAgB,iBAAiB,CAC/B,GAAiB,EACjB,MAAoB,EACpB,UAA0B,EAAE;IAE5B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAa,MAAM,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,CAAC,GAAG,IAAA,sBAAY,EAAC,GAAG,CAAC,CAAC,CAAC;IACrC,yDAAyD;IACzD,8DAA8D;IAC9D,MAAM,cAAc,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;IACvD,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,gBAAgB,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IAE/E,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;YACnD,KAAK,MAAM,GAAG,IAAI,kBAAkB,CAAC,IAAI,EAAE,cAAc,CAAC,EAAE,CAAC;gBAC3D,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC;gBAChB,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;oBAC1B,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;gBACjE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AACtC,CAAC"}

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

@@ -0,0 +1,61 @@
+/**
+ * Axiomas de frame disponibles. Cualquier subconjunto define una
+ * lógica modal normal.
+ */
+export type FrameAxiom = 'T' | 'B' | '4' | '5' | 'D';
+/**
+ * Sistemas modales nombrados que reconoce {@link systemAxioms}.
+ * Cualquier otra combinación puede construirse pasando los axiomas
+ * directamente a {@link tableauWithAxioms}.
+ */
+export type ModalSystem = 'K' | 'T' | 'D' | 'B' | 'S4' | 'S5' | 'KD45' | 'KB' | 'K4' | 'K5';
+/**
+ * Fórmula modal proposicional. Estructura discriminada por `kind`.
+ *
+ * Convenciones:
+ *   - 'atom'     usa `name`.
+ *   - 'not'      usa `arg`.
+ *   - 'box'      usa `arg`  (□φ — necesidad).
+ *   - 'diamond'  usa `arg`  (◇φ — posibilidad).
+ *   - 'and' / 'or' / 'implies' usan `left` y `right`.
+ *
+ * Se mantiene también `args` como alternativa lista para
+ * compatibilidad con consumidores que prefieren n-arios.
+ */
+export interface ModalFormula {
+    kind: 'atom' | 'not' | 'and' | 'or' | 'implies' | 'box' | 'diamond';
+    name?: string;
+    arg?: ModalFormula;
+    args?: ModalFormula[];
+    left?: ModalFormula;
+    right?: ModalFormula;
+}
+/**
+ * Modelo de Kripke devuelto cuando una fórmula es satisfacible.
+ *
+ *   - `worlds`        : nombres simbólicos de mundos (e.g. "w0", "w1").
+ *   - `accessibility` : aristas dirigidas `[from, to]` del frame.
+ *   - `valuation`     : por mundo, los átomos verdaderos en ese mundo.
+ *   - `actual`        : mundo "real" donde se evalúa la fórmula
+ *                       (típicamente "w0").
+ */
+export interface KripkeModel {
+    worlds: string[];
+    accessibility: Array<[string, string]>;
+    valuation: Map<string, Set<string>>;
+    actual: string;
+}
+/**
+ * Resultado del tableau / búsqueda de modelo.
+ *
+ *   - `sat`    : ¿existe modelo en el frame indicado?
+ *   - `model`  : si `sat`, modelo concreto (raíz = actual world).
+ *   - `closed` : ¿el tableau cerró todas las ramas? (= ¬sat).
+ *                Para una búsqueda saturada: closed ⇔ ¬sat.
+ */
+export interface TableauResult {
+    sat: boolean;
+    model?: KripkeModel;
+    closed: boolean;
+}
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/profiles/modal-frame-axioms/types.ts"],"names":[],"mappings":"AAyBA;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAErD;;;;GAIG;AACH,MAAM,MAAM,WAAW,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;AAE5F;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,CAAC;IACpE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,GAAG,CAAC,EAAE,YAAY,CAAC;IACnB,IAAI,CAAC,EAAE,YAAY,EAAE,CAAC;IACtB,IAAI,CAAC,EAAE,YAAY,CAAC;IACpB,KAAK,CAAC,EAAE,YAAY,CAAC;CACtB;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,aAAa,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvC,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACpC,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,aAAa;IAC5B,GAAG,EAAE,OAAO,CAAC;IACb,KAAK,CAAC,EAAE,WAAW,CAAC;IACpB,MAAM,EAAE,OAAO,CAAC;CACjB"}

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

@@ -0,0 +1,27 @@
+"use strict";
+// ============================================================
+// Modal Frame Axioms — Tipos
+// ============================================================
+//
+// Lógicas modales normales caracterizadas por axiomas de frame:
+//
+//   T : □φ → φ            reflexividad     ∀w. R(w,w)
+//   B : φ → □◇φ           simetría         ∀w,v. R(w,v) → R(v,w)
+//   4 : □φ → □□φ          transitividad    ∀w,v,u. R(w,v)∧R(v,u) → R(w,u)
+//   5 : ◇φ → □◇φ          euclidianidad    ∀w,v,u. R(w,v)∧R(w,u) → R(v,u)
+//   D : □φ → ◇φ           serialidad       ∀w. ∃v. R(w,v)
+//
+// Sistemas estándar como composiciones:
+//
+//   K     = ∅          (sin axiomas, sólo K y N)
+//   T     = {T}        reflexivo
+//   D     = {D}        serial
+//   B     = {T, B}     reflexivo + simétrico  (a veces KB = {B} sin T)
+//   K4    = {4}        transitivo
+//   K5    = {5}        euclidiano
+//   KB    = {B}        sólo simétrico
+//   S4    = {T, 4}     reflexivo + transitivo
+//   S5    = {T, 4, 5}  equivalencia (≡ T+B+4 ≡ T+5)
+//   KD45  = {D, 4, 5}  serial + trans + eucl  (modelo doxástico)
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/profiles/modal-frame-axioms/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6BAA6B;AAC7B,+DAA+D;AAC/D,EAAE;AACF,gEAAgE;AAChE,EAAE;AACF,sDAAsD;AACtD,iEAAiE;AACjE,0EAA0E;AAC1E,0EAA0E;AAC1E,0DAA0D;AAC1D,EAAE;AACF,wCAAwC;AACxC,EAAE;AACF,iDAAiD;AACjD,iCAAiC;AACjC,8BAA8B;AAC9B,uEAAuE;AACvE,kCAAkC;AAClC,kCAAkC;AAClC,sCAAsC;AACtC,8CAA8C;AAC9C,oDAAoD;AACpD,iEAAiE"}

package/dist/profiles/substructural/index.d.ts

@@ -0,0 +1,4 @@
+export type { LinearFormula, LinearSequent, LinearProof, SequentRule, SubstructuralMode, } from './types';
+export { proveLinear, proveAffine, proofToString, formulaKey } from './prover';
+export type { ProveOptions, ProveResult } from './prover';
+//# sourceMappingURL=index.d.ts.map

package/dist/profiles/substructural/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/profiles/substructural/index.ts"],"names":[],"mappings":"AAcA,YAAY,EACV,aAAa,EACb,aAAa,EACb,WAAW,EACX,WAAW,EACX,iBAAiB,GAClB,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAC/E,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC"}

package/dist/profiles/substructural/index.js

@@ -0,0 +1,22 @@
+"use strict";
+// ============================================================
+// Substructural Logics — Public entrypoint
+// ============================================================
+//
+// Logicas substructurales (Linear y Affine) con calculo de
+// secuentes intuicionistico unilateral. Conectivos multiplicativos
+// (⊗, ⊸, 1), aditivos (&, ⊕) y el exponencial bang (!).
+//
+//   import {
+//     LinearFormula,
+//     proveLinear,
+//     proveAffine,
+//   } from 'src/profiles/substructural';
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.formulaKey = exports.proofToString = exports.proveAffine = exports.proveLinear = void 0;
+var prover_1 = require("./prover");
+Object.defineProperty(exports, "proveLinear", { enumerable: true, get: function () { return prover_1.proveLinear; } });
+Object.defineProperty(exports, "proveAffine", { enumerable: true, get: function () { return prover_1.proveAffine; } });
+Object.defineProperty(exports, "proofToString", { enumerable: true, get: function () { return prover_1.proofToString; } });
+Object.defineProperty(exports, "formulaKey", { enumerable: true, get: function () { return prover_1.formulaKey; } });
+//# sourceMappingURL=index.js.map

package/dist/profiles/substructural/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/substructural/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,2CAA2C;AAC3C,+DAA+D;AAC/D,EAAE;AACF,2DAA2D;AAC3D,mEAAmE;AACnE,wDAAwD;AACxD,EAAE;AACF,aAAa;AACb,qBAAqB;AACrB,mBAAmB;AACnB,mBAAmB;AACnB,yCAAyC;;;AAUzC,mCAA+E;AAAtE,qGAAA,WAAW,OAAA;AAAE,qGAAA,WAAW,OAAA;AAAE,uGAAA,aAAa,OAAA;AAAE,oGAAA,UAAU,OAAA"}

package/dist/profiles/substructural/prover.d.ts

@@ -0,0 +1,13 @@
+import { LinearFormula, LinearProof, LinearSequent } from './types';
+export declare function formulaKey(f: LinearFormula): string;
+export interface ProveOptions {
+    budget?: number;
+}
+export interface ProveResult {
+    provable: boolean;
+    proof?: LinearProof;
+}
+export declare function proveLinear(seqInput: LinearSequent, options?: ProveOptions): LinearProof | null;
+export declare function proveAffine(seqInput: LinearSequent, options?: ProveOptions): LinearProof | null;
+export declare function proofToString(p: LinearProof, indent?: number): string;
+//# sourceMappingURL=prover.d.ts.map

package/dist/profiles/substructural/prover.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover.d.ts","sourceRoot":"","sources":["../../../src/profiles/substructural/prover.ts"],"names":[],"mappings":"AA0CA,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,aAAa,EAAkC,MAAM,SAAS,CAAC;AAIpG,wBAAgB,UAAU,CAAC,CAAC,EAAE,aAAa,GAAG,MAAM,CAmBnD;AA6aD,MAAM,WAAW,YAAY;IAC3B,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,WAAW,CAAC;CACrB;AAqBD,wBAAgB,WAAW,CAAC,QAAQ,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,WAAW,GAAG,IAAI,CAG/F;AAED,wBAAgB,WAAW,CAAC,QAAQ,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,WAAW,GAAG,IAAI,CAG/F;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,SAAI,GAAG,MAAM,CAOhE"}