@stevenvo780/st-lang 4.1.0 → 4.3.0

package/dist/profiles/intuitionistic-nj/formula.js

@@ -0,0 +1,99 @@
+"use strict";
+// ============================================================
+// Helpers de fórmulas intuicionistas
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.implies = exports.or = exports.and = exports.not = exports.bottom = exports.atom = void 0;
+exports.formulaKey = formulaKey;
+exports.formulaEquals = formulaEquals;
+exports.formulaToString = formulaToString;
+exports.collectAtoms = collectAtoms;
+/**
+ * Clave sintáctica estable para deduplicación / memoización.
+ * Determinista y libre de ambigüedades por paréntesis explícitos.
+ */
+function formulaKey(f) {
+    switch (f.kind) {
+        case 'atom':
+            return `A(${f.name})`;
+        case 'bottom':
+            return '⊥';
+        case 'not':
+            return `N(${formulaKey(f.arg)})`;
+        case 'and':
+            return `&(${formulaKey(f.left)},${formulaKey(f.right)})`;
+        case 'or':
+            return `|(${formulaKey(f.left)},${formulaKey(f.right)})`;
+        case 'implies':
+            return `>(${formulaKey(f.left)},${formulaKey(f.right)})`;
+    }
+}
+function formulaEquals(a, b) {
+    return formulaKey(a) === formulaKey(b);
+}
+function formulaToString(f) {
+    switch (f.kind) {
+        case 'atom':
+            return f.name;
+        case 'bottom':
+            return '⊥';
+        case 'not':
+            return `¬${parens(f.arg)}`;
+        case 'and':
+            return `(${formulaToString(f.left)} ∧ ${formulaToString(f.right)})`;
+        case 'or':
+            return `(${formulaToString(f.left)} ∨ ${formulaToString(f.right)})`;
+        case 'implies':
+            return `(${formulaToString(f.left)} → ${formulaToString(f.right)})`;
+    }
+}
+function parens(f) {
+    if (f.kind === 'atom' || f.kind === 'bottom')
+        return formulaToString(f);
+    return `(${formulaToString(f)})`;
+}
+/**
+ * Recolecta los átomos proposicionales (por nombre) que aparecen en `f`.
+ */
+function collectAtoms(f, out = new Set()) {
+    switch (f.kind) {
+        case 'atom':
+            out.add(f.name);
+            return out;
+        case 'bottom':
+            return out;
+        case 'not':
+            return collectAtoms(f.arg, out);
+        case 'and':
+        case 'or':
+        case 'implies':
+            collectAtoms(f.left, out);
+            return collectAtoms(f.right, out);
+    }
+}
+// Constructores ergonómicos -----------------------------------
+const atom = (name) => ({ kind: 'atom', name });
+exports.atom = atom;
+const bottom = () => ({ kind: 'bottom' });
+exports.bottom = bottom;
+const not = (arg) => ({ kind: 'not', arg });
+exports.not = not;
+const and = (left, right) => ({
+    kind: 'and',
+    left,
+    right,
+});
+exports.and = and;
+const or = (left, right) => ({
+    kind: 'or',
+    left,
+    right,
+});
+exports.or = or;
+const implies = (left, right) => ({
+    kind: 'implies',
+    left,
+    right,
+});
+exports.implies = implies;
+//# sourceMappingURL=formula.js.map

package/dist/profiles/intuitionistic-nj/formula.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"formula.js","sourceRoot":"","sources":["../../../src/profiles/intuitionistic-nj/formula.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qCAAqC;AACrC,+DAA+D;;;AAQ/D,gCAeC;AAED,sCAEC;AAED,0CAeC;AAUD,oCAeC;AAjED;;;GAGG;AACH,SAAgB,UAAU,CAAC,CAAgB;IACzC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC;QACxB,KAAK,QAAQ;YACX,OAAO,GAAG,CAAC;QACb,KAAK,KAAK;YACR,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QACnC,KAAK,KAAK;YACR,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAC3D,KAAK,IAAI;YACP,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAC3D,KAAK,SAAS;YACZ,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;IAC7D,CAAC;AACH,CAAC;AAED,SAAgB,aAAa,CAAC,CAAgB,EAAE,CAAgB;IAC9D,OAAO,UAAU,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,SAAgB,eAAe,CAAC,CAAgB;IAC9C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,QAAQ;YACX,OAAO,GAAG,CAAC;QACb,KAAK,KAAK;YACR,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,KAAK;YACR,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QACtE,KAAK,IAAI;YACP,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QACtE,KAAK,SAAS;YACZ,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;IACxE,CAAC;AACH,CAAC;AAED,SAAS,MAAM,CAAC,CAAgB;IAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,eAAe,CAAC,CAAC,CAAC,CAAC;IACxE,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC;AACnC,CAAC;AAED;;GAEG;AACH,SAAgB,YAAY,CAAC,CAAgB,EAAE,MAAmB,IAAI,GAAG,EAAE;IACzE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO,GAAG,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,GAAG,CAAC;QACb,KAAK,KAAK;YACR,OAAO,YAAY,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAClC,KAAK,KAAK,CAAC;QACX,KAAK,IAAI,CAAC;QACV,KAAK,SAAS;YACZ,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC1B,OAAO,YAAY,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACtC,CAAC;AACH,CAAC;AAED,gEAAgE;AAEzD,MAAM,IAAI,GAAG,CAAC,IAAY,EAAiB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAAjE,QAAA,IAAI,QAA6D;AACvE,MAAM,MAAM,GAAG,GAAkB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;AAAnD,QAAA,MAAM,UAA6C;AACzD,MAAM,GAAG,GAAG,CAAC,GAAkB,EAAiB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;AAApE,QAAA,GAAG,OAAiE;AAC1E,MAAM,GAAG,GAAG,CAAC,IAAmB,EAAE,KAAoB,EAAiB,EAAE,CAAC,CAAC;IAChF,IAAI,EAAE,KAAK;IACX,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAJU,QAAA,GAAG,OAIb;AACI,MAAM,EAAE,GAAG,CAAC,IAAmB,EAAE,KAAoB,EAAiB,EAAE,CAAC,CAAC;IAC/E,IAAI,EAAE,IAAI;IACV,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAJU,QAAA,EAAE,MAIZ;AACI,MAAM,OAAO,GAAG,CAAC,IAAmB,EAAE,KAAoB,EAAiB,EAAE,CAAC,CAAC;IACpF,IAAI,EAAE,SAAS;IACf,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAJU,QAAA,OAAO,WAIjB"}

package/dist/profiles/intuitionistic-nj/index.d.ts

@@ -0,0 +1,5 @@
+export type { IntuitFormula, ProofRule, NJProof, KripkeIntuitModel } from './types';
+export { formulaKey, formulaEquals, formulaToString, collectAtoms, atom, bottom, not, and, or, implies, } from './formula';
+export { proveIntuitionistically, verifyProof } from './prover';
+export { kripkeCounterModel, isIPCValid } from './kripke';
+//# sourceMappingURL=index.d.ts.map

package/dist/profiles/intuitionistic-nj/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/profiles/intuitionistic-nj/index.ts"],"names":[],"mappings":"AAIA,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAEpF,OAAO,EACL,UAAU,EACV,aAAa,EACb,eAAe,EACf,YAAY,EACZ,IAAI,EACJ,MAAM,EACN,GAAG,EACH,GAAG,EACH,EAAE,EACF,OAAO,GACR,MAAM,WAAW,CAAC;AAEnB,OAAO,EAAE,uBAAuB,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAEhE,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC"}

package/dist/profiles/intuitionistic-nj/index.js

@@ -0,0 +1,24 @@
+"use strict";
+// ============================================================
+// Intuitionistic Natural Deduction (NJ) — Entrada pública
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isIPCValid = exports.kripkeCounterModel = exports.verifyProof = exports.proveIntuitionistically = exports.implies = exports.or = exports.and = exports.not = exports.bottom = exports.atom = exports.collectAtoms = exports.formulaToString = exports.formulaEquals = exports.formulaKey = void 0;
+var formula_1 = require("./formula");
+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; } });
+Object.defineProperty(exports, "atom", { enumerable: true, get: function () { return formula_1.atom; } });
+Object.defineProperty(exports, "bottom", { enumerable: true, get: function () { return formula_1.bottom; } });
+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; } });
+var prover_1 = require("./prover");
+Object.defineProperty(exports, "proveIntuitionistically", { enumerable: true, get: function () { return prover_1.proveIntuitionistically; } });
+Object.defineProperty(exports, "verifyProof", { enumerable: true, get: function () { return prover_1.verifyProof; } });
+var kripke_1 = require("./kripke");
+Object.defineProperty(exports, "kripkeCounterModel", { enumerable: true, get: function () { return kripke_1.kripkeCounterModel; } });
+Object.defineProperty(exports, "isIPCValid", { enumerable: true, get: function () { return kripke_1.isIPCValid; } });
+//# sourceMappingURL=index.js.map

package/dist/profiles/intuitionistic-nj/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/intuitionistic-nj/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,0DAA0D;AAC1D,+DAA+D;;;AAI/D,qCAWmB;AAVjB,qGAAA,UAAU,OAAA;AACV,wGAAA,aAAa,OAAA;AACb,0GAAA,eAAe,OAAA;AACf,uGAAA,YAAY,OAAA;AACZ,+FAAA,IAAI,OAAA;AACJ,iGAAA,MAAM,OAAA;AACN,8FAAA,GAAG,OAAA;AACH,8FAAA,GAAG,OAAA;AACH,6FAAA,EAAE,OAAA;AACF,kGAAA,OAAO,OAAA;AAGT,mCAAgE;AAAvD,iHAAA,uBAAuB,OAAA;AAAE,qGAAA,WAAW,OAAA;AAE7C,mCAA0D;AAAjD,4GAAA,kBAAkB,OAAA;AAAE,oGAAA,UAAU,OAAA"}

package/dist/profiles/intuitionistic-nj/kripke.d.ts

@@ -0,0 +1,17 @@
+import { IntuitFormula, KripkeIntuitModel } from './types';
+/**
+ * API pública: si `formula` NO es válida intuicionistamente,
+ * devuelve un modelo Kripke cuya raíz (w0) la refuta. Si es
+ * válida, devuelve `null`.
+ *
+ * El budget máximo (mundos) se ajusta a la cantidad de átomos.
+ */
+export declare function kripkeCounterModel(formula: IntuitFormula, options?: {
+    maxWorlds?: number;
+}): KripkeIntuitModel | null;
+/**
+ * Helper: ¿la fórmula es válida intuicionistamente bajo modelos
+ * de tamaño ≤ `maxWorlds`? Útil en tests para cruzar con el prover.
+ */
+export declare function isIPCValid(formula: IntuitFormula, maxWorlds?: number): boolean;
+//# sourceMappingURL=kripke.d.ts.map

package/dist/profiles/intuitionistic-nj/kripke.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kripke.d.ts","sourceRoot":"","sources":["../../../src/profiles/intuitionistic-nj/kripke.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,aAAa,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAsK3D;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,aAAa,EACtB,OAAO,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GACnC,iBAAiB,GAAG,IAAI,CAS1B;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,aAAa,EAAE,SAAS,SAAI,GAAG,OAAO,CAEzE"}

package/dist/profiles/intuitionistic-nj/kripke.js

@@ -0,0 +1,206 @@
+"use strict";
+// ============================================================
+// Kripke counter-models para IPC
+// ============================================================
+//
+// IPC es completa respecto a frames de Kripke finitos
+// (Kripke 1965). Una fórmula no es un teorema intuicionista
+// sii existe un modelo de Kripke finito (preorden + forcing
+// persistente) cuya raíz no la fuerza.
+//
+// Estrategia: enumeración acotada de preórdenes sobre
+// {w0,...,w_{k-1}} y todas las valuaciones persistentes
+// (subconjuntos upward-closed por cada átomo).
+//
+// Para refutar contraejemplos clásicos típicos (¬¬P → P,
+// P ∨ ¬P, Peirce) bastan 2-3 mundos.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.kripkeCounterModel = kripkeCounterModel;
+exports.isIPCValid = isIPCValid;
+const formula_1 = require("./formula");
+/**
+ * Forcing intuicionista en `w` para `f`.
+ */
+function forces(model, w, f) {
+    switch (f.kind) {
+        case 'atom':
+            return model.val.get(w)?.has(f.name) ?? false;
+        case 'bottom':
+            return false;
+        case 'and':
+            return forces(model, w, f.left) && forces(model, w, f.right);
+        case 'or':
+            return forces(model, w, f.left) || forces(model, w, f.right);
+        case 'implies': {
+            for (const v of model.access.get(w) ?? []) {
+                if (forces(model, v, f.left) && !forces(model, v, f.right))
+                    return false;
+            }
+            return true;
+        }
+        case 'not': {
+            for (const v of model.access.get(w) ?? []) {
+                if (forces(model, v, f.arg))
+                    return false;
+            }
+            return true;
+        }
+    }
+}
+/**
+ * Cierra `access` reflexiva y transitivamente in-place.
+ */
+function reflexiveTransitiveClosure(access, worlds) {
+    for (const w of worlds) {
+        if (!access.has(w))
+            access.set(w, new Set());
+        access.get(w).add(w);
+    }
+    let changed = true;
+    while (changed) {
+        changed = false;
+        for (const w of worlds) {
+            const acc = access.get(w);
+            const additions = [];
+            for (const v of acc) {
+                for (const u of access.get(v) ?? []) {
+                    if (!acc.has(u))
+                        additions.push(u);
+                }
+            }
+            for (const u of additions) {
+                acc.add(u);
+                changed = true;
+            }
+        }
+    }
+}
+/**
+ * Devuelve todos los conjuntos upward-closed (en el preorden
+ * dado por `access`) sobre `worlds`. Usados para construir
+ * valuaciones persistentes.
+ */
+function upwardClosedSets(worlds, access) {
+    const out = [];
+    const n = worlds.length;
+    for (let mask = 0; mask < 1 << n; mask++) {
+        const subset = new Set();
+        for (let i = 0; i < n; i++) {
+            if (mask & (1 << i))
+                subset.add(worlds[i]);
+        }
+        let upward = true;
+        for (const w of subset) {
+            for (const v of access.get(w) ?? []) {
+                if (!subset.has(v)) {
+                    upward = false;
+                    break;
+                }
+            }
+            if (!upward)
+                break;
+        }
+        if (upward)
+            out.push([...subset]);
+    }
+    return out;
+}
+/**
+ * Genera preórdenes únicos (módulo cierre transitivo) sobre
+ * `size` mundos.
+ */
+function* generatePreorders(size) {
+    const worlds = Array.from({ length: size }, (_, i) => i);
+    const pairs = [];
+    for (let i = 0; i < size; i++) {
+        for (let j = 0; j < size; j++) {
+            if (i !== j)
+                pairs.push([i, j]);
+        }
+    }
+    const seen = new Set();
+    const total = 1 << pairs.length;
+    for (let mask = 0; mask < total; mask++) {
+        const access = new Map();
+        for (const w of worlds)
+            access.set(w, new Set());
+        for (let b = 0; b < pairs.length; b++) {
+            if (mask & (1 << b)) {
+                const [from, to] = pairs[b];
+                access.get(from).add(to);
+            }
+        }
+        reflexiveTransitiveClosure(access, worlds);
+        let hash = '';
+        for (const w of worlds) {
+            hash += `${w}:${[...access.get(w)].sort((a, b) => a - b).join(',')};`;
+        }
+        if (seen.has(hash))
+            continue;
+        seen.add(hash);
+        yield access;
+    }
+}
+function* generateModels(atoms, maxWorlds) {
+    for (let size = 1; size <= maxWorlds; size++) {
+        const worlds = Array.from({ length: size }, (_, i) => i);
+        for (const access of generatePreorders(size)) {
+            const upwards = upwardClosedSets(worlds, access);
+            // Cada átomo elige uno de los upward-closed sets.
+            const k = atoms.length;
+            const total = Math.pow(upwards.length, k);
+            for (let i = 0; i < total; i++) {
+                const val = new Map();
+                for (const w of worlds)
+                    val.set(w, new Set());
+                let idx = i;
+                for (let a = 0; a < k; a++) {
+                    const setIdx = idx % upwards.length;
+                    idx = Math.floor(idx / upwards.length);
+                    for (const w of upwards[setIdx]) {
+                        val.get(w).add(atoms[a]);
+                    }
+                }
+                yield { worlds, access, val };
+            }
+        }
+    }
+}
+function toPublic(model) {
+    const worlds = model.worlds.map((w) => `w${w}`);
+    const accessibility = [];
+    for (const [from, tos] of model.access) {
+        for (const to of tos)
+            accessibility.push([`w${from}`, `w${to}`]);
+    }
+    const forcing = new Map();
+    for (const [w, atoms] of model.val) {
+        forcing.set(`w${w}`, new Set(atoms));
+    }
+    return { worlds, accessibility, forcing };
+}
+/**
+ * API pública: si `formula` NO es válida intuicionistamente,
+ * devuelve un modelo Kripke cuya raíz (w0) la refuta. Si es
+ * válida, devuelve `null`.
+ *
+ * El budget máximo (mundos) se ajusta a la cantidad de átomos.
+ */
+function kripkeCounterModel(formula, options = {}) {
+    const atoms = [...(0, formula_1.collectAtoms)(formula)];
+    const cap = options.maxWorlds ?? (atoms.length <= 2 ? 3 : 2);
+    for (const model of generateModels(atoms, cap)) {
+        if (!forces(model, 0, formula)) {
+            return toPublic(model);
+        }
+    }
+    return null;
+}
+/**
+ * Helper: ¿la fórmula es válida intuicionistamente bajo modelos
+ * de tamaño ≤ `maxWorlds`? Útil en tests para cruzar con el prover.
+ */
+function isIPCValid(formula, maxWorlds = 3) {
+    return kripkeCounterModel(formula, { maxWorlds }) === null;
+}
+//# sourceMappingURL=kripke.js.map

package/dist/profiles/intuitionistic-nj/kripke.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kripke.js","sourceRoot":"","sources":["../../../src/profiles/intuitionistic-nj/kripke.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iCAAiC;AACjC,+DAA+D;AAC/D,EAAE;AACF,sDAAsD;AACtD,4DAA4D;AAC5D,4DAA4D;AAC5D,uCAAuC;AACvC,EAAE;AACF,sDAAsD;AACtD,wDAAwD;AACxD,+CAA+C;AAC/C,EAAE;AACF,yDAAyD;AACzD,qCAAqC;;AA+KrC,gDAYC;AAMD,gCAEC;AAhMD,uCAAyC;AAUzC;;GAEG;AACH,SAAS,MAAM,CAAC,KAAoB,EAAE,CAAS,EAAE,CAAgB;IAC/D,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC;QAChD,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC;QACf,KAAK,KAAK;YACR,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAC/D,KAAK,IAAI;YACP,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAC/D,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC1C,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;YAC3E,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC1C,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;oBAAE,OAAO,KAAK,CAAC;YAC5C,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,0BAA0B,CAAC,MAAgC,EAAE,MAAgB;IACpF,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;YAC3B,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;gBACpB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;oBACpC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC1B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACX,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,MAAgB,EAAE,MAAgC;IAC1E,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,MAAM,GAAG,IAAI,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBACpC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnB,MAAM,GAAG,KAAK,CAAC;oBACf,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,CAAC,MAAM;gBAAE,MAAM;QACrB,CAAC;QACD,IAAI,MAAM;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,QAAQ,CAAC,CAAC,iBAAiB,CAAC,IAAY;IACtC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACzD,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,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC;IAChC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;QACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACjD,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,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,0BAA0B,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACzE,CAAC;QACD,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACf,MAAM,MAAM,CAAC;IACf,CAAC;AACH,CAAC;AAED,QAAQ,CAAC,CAAC,cAAc,CAAC,KAAe,EAAE,SAAiB;IACzD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC;QAC7C,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,KAAK,MAAM,MAAM,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACjD,kDAAkD;YAClD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;gBAC3C,KAAK,MAAM,CAAC,IAAI,MAAM;oBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBAC9C,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,MAAM,GAAG,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;oBACpC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;oBACvC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;wBAChC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC5B,CAAC;gBACH,CAAC;gBACD,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,KAAoB;IACpC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChD,MAAM,aAAa,GAA4B,EAAE,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,GAAG;YAAE,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,KAAK,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,EAAE,CAAC;QACnC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC;AAC5C,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,kBAAkB,CAChC,OAAsB,EACtB,UAAkC,EAAE;IAEpC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAA,sBAAY,EAAC,OAAO,CAAC,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;QAC/C,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;YAC/B,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,UAAU,CAAC,OAAsB,EAAE,SAAS,GAAG,CAAC;IAC9D,OAAO,kBAAkB,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,CAAC,KAAK,IAAI,CAAC;AAC7D,CAAC"}

package/dist/profiles/intuitionistic-nj/prover.d.ts

@@ -0,0 +1,13 @@
+import { IntuitFormula, NJProof } from './types';
+/**
+ * API pública.
+ *
+ * Devuelve un árbol NJ que demuestra `goal` a partir de las
+ * `premises` dadas, o `null` si no encontró prueba dentro del
+ * budget configurado.
+ */
+export declare function proveIntuitionistically(premises: IntuitFormula[], goal: IntuitFormula, options?: {
+    budget?: number;
+}): NJProof | null;
+export declare function verifyProof(proof: NJProof, initialContext?: IntuitFormula[]): boolean;
+//# sourceMappingURL=prover.d.ts.map

package/dist/profiles/intuitionistic-nj/prover.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover.d.ts","sourceRoot":"","sources":["../../../src/profiles/intuitionistic-nj/prover.ts"],"names":[],"mappings":"AAuBA,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAyRjD;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,QAAQ,EAAE,aAAa,EAAE,EACzB,IAAI,EAAE,aAAa,EACnB,OAAO,GAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAA;CAAO,GAChC,OAAO,GAAG,IAAI,CAGhB;AAQD,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,cAAc,GAAE,aAAa,EAAO,GAAG,OAAO,CAEzF"}