@stevenvo780/st-lang 4.9.0 → 4.10.0

package/dist/logic/profiles/natural-deduction-nk/formula.d.ts

@@ -0,0 +1,18 @@
+import { NKFormula } from './types';
+/**
+ * Clave sintáctica estable para deduplicación / memoización.
+ */
+export declare function formulaKey(f: NKFormula): string;
+export declare function formulaEquals(a: NKFormula, b: NKFormula): boolean;
+export declare function formulaToString(f: NKFormula): string;
+/**
+ * Recolecta los átomos proposicionales que aparecen en `f`.
+ */
+export declare function collectAtoms(f: NKFormula, out?: Set<string>): Set<string>;
+export declare const atom: (name: string) => NKFormula;
+export declare const bottom: () => NKFormula;
+export declare const not: (arg: NKFormula) => NKFormula;
+export declare const and: (left: NKFormula, right: NKFormula) => NKFormula;
+export declare const or: (left: NKFormula, right: NKFormula) => NKFormula;
+export declare const implies: (left: NKFormula, right: NKFormula) => NKFormula;
+//# sourceMappingURL=formula.d.ts.map

package/dist/logic/profiles/natural-deduction-nk/formula.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"formula.d.ts","sourceRoot":"","sources":["../../../../src/logic/profiles/natural-deduction-nk/formula.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAEpC;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAe/C;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,OAAO,CAEjE;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAepD;AAOD;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,GAAE,GAAG,CAAC,MAAM,CAAa,GAAG,GAAG,CAAC,MAAM,CAAC,CAepF;AAID,eAAO,MAAM,IAAI,GAAI,MAAM,MAAM,KAAG,SAAqC,CAAC;AAC1E,eAAO,MAAM,MAAM,QAAO,SAAiC,CAAC;AAC5D,eAAO,MAAM,GAAG,GAAI,KAAK,SAAS,KAAG,SAAmC,CAAC;AACzE,eAAO,MAAM,GAAG,GAAI,MAAM,SAAS,EAAE,OAAO,SAAS,KAAG,SAItD,CAAC;AACH,eAAO,MAAM,EAAE,GAAI,MAAM,SAAS,EAAE,OAAO,SAAS,KAAG,SAIrD,CAAC;AACH,eAAO,MAAM,OAAO,GAAI,MAAM,SAAS,EAAE,OAAO,SAAS,KAAG,SAI1D,CAAC"}

package/dist/logic/profiles/natural-deduction-nk/formula.js

@@ -0,0 +1,102 @@
+"use strict";
+// ============================================================
+// Helpers de fórmulas clásicas (NK)
+// ============================================================
+//
+// Estructuralmente idéntico al de NJ; la diferencia con la
+// lógica intuicionista no está en la sintaxis sino en las reglas
+// admisibles.
+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.
+ */
+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 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/logic/profiles/natural-deduction-nk/formula.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"formula.js","sourceRoot":"","sources":["../../../../src/logic/profiles/natural-deduction-nk/formula.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,oCAAoC;AACpC,+DAA+D;AAC/D,EAAE;AACF,2DAA2D;AAC3D,iEAAiE;AACjE,cAAc;;;AAOd,gCAeC;AAED,sCAEC;AAED,0CAeC;AAUD,oCAeC;AAhED;;GAEG;AACH,SAAgB,UAAU,CAAC,CAAY;IACrC,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,CAAY,EAAE,CAAY;IACtD,OAAO,UAAU,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,SAAgB,eAAe,CAAC,CAAY;IAC1C,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,CAAY;IAC1B,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,CAAY,EAAE,MAAmB,IAAI,GAAG,EAAE;IACrE,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,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAA7D,QAAA,IAAI,QAAyD;AACnE,MAAM,MAAM,GAAG,GAAc,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;AAA/C,QAAA,MAAM,UAAyC;AACrD,MAAM,GAAG,GAAG,CAAC,GAAc,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;AAA5D,QAAA,GAAG,OAAyD;AAClE,MAAM,GAAG,GAAG,CAAC,IAAe,EAAE,KAAgB,EAAa,EAAE,CAAC,CAAC;IACpE,IAAI,EAAE,KAAK;IACX,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAJU,QAAA,GAAG,OAIb;AACI,MAAM,EAAE,GAAG,CAAC,IAAe,EAAE,KAAgB,EAAa,EAAE,CAAC,CAAC;IACnE,IAAI,EAAE,IAAI;IACV,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAJU,QAAA,EAAE,MAIZ;AACI,MAAM,OAAO,GAAG,CAAC,IAAe,EAAE,KAAgB,EAAa,EAAE,CAAC,CAAC;IACxE,IAAI,EAAE,SAAS;IACf,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAJU,QAAA,OAAO,WAIjB"}

package/dist/logic/profiles/natural-deduction-nk/index.d.ts

@@ -0,0 +1,5 @@
+export type { NKFormula, NKRule, NKProof } from './types';
+export { CLASSICAL_ONLY_RULES } from './types';
+export { formulaKey, formulaEquals, formulaToString, collectAtoms, atom, bottom, not, and, or, implies, } from './formula';
+export { proveClassically, proveIntuitOnly, verifyProof, provedPeirce, provedDNE, provedLEM, nkToNJ, } from './prover';
+//# sourceMappingURL=index.d.ts.map

package/dist/logic/profiles/natural-deduction-nk/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/logic/profiles/natural-deduction-nk/index.ts"],"names":[],"mappings":"AAIA,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAC1D,OAAO,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAC;AAE/C,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,EACL,gBAAgB,EAChB,eAAe,EACf,WAAW,EACX,YAAY,EACZ,SAAS,EACT,SAAS,EACT,MAAM,GACP,MAAM,UAAU,CAAC"}

package/dist/logic/profiles/natural-deduction-nk/index.js

@@ -0,0 +1,28 @@
+"use strict";
+// ============================================================
+// Natural Deduction NK (classical) — Entrada pública
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.nkToNJ = exports.provedLEM = exports.provedDNE = exports.provedPeirce = exports.verifyProof = exports.proveIntuitOnly = exports.proveClassically = exports.implies = exports.or = exports.and = exports.not = exports.bottom = exports.atom = exports.collectAtoms = exports.formulaToString = exports.formulaEquals = exports.formulaKey = exports.CLASSICAL_ONLY_RULES = void 0;
+var types_1 = require("./types");
+Object.defineProperty(exports, "CLASSICAL_ONLY_RULES", { enumerable: true, get: function () { return types_1.CLASSICAL_ONLY_RULES; } });
+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, "proveClassically", { enumerable: true, get: function () { return prover_1.proveClassically; } });
+Object.defineProperty(exports, "proveIntuitOnly", { enumerable: true, get: function () { return prover_1.proveIntuitOnly; } });
+Object.defineProperty(exports, "verifyProof", { enumerable: true, get: function () { return prover_1.verifyProof; } });
+Object.defineProperty(exports, "provedPeirce", { enumerable: true, get: function () { return prover_1.provedPeirce; } });
+Object.defineProperty(exports, "provedDNE", { enumerable: true, get: function () { return prover_1.provedDNE; } });
+Object.defineProperty(exports, "provedLEM", { enumerable: true, get: function () { return prover_1.provedLEM; } });
+Object.defineProperty(exports, "nkToNJ", { enumerable: true, get: function () { return prover_1.nkToNJ; } });
+//# sourceMappingURL=index.js.map

package/dist/logic/profiles/natural-deduction-nk/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/logic/profiles/natural-deduction-nk/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qDAAqD;AACrD,+DAA+D;;;AAG/D,iCAA+C;AAAtC,6GAAA,oBAAoB,OAAA;AAE7B,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,mCAQkB;AAPhB,0GAAA,gBAAgB,OAAA;AAChB,yGAAA,eAAe,OAAA;AACf,qGAAA,WAAW,OAAA;AACX,sGAAA,YAAY,OAAA;AACZ,mGAAA,SAAS,OAAA;AACT,mGAAA,SAAS,OAAA;AACT,gGAAA,MAAM,OAAA"}

package/dist/logic/profiles/natural-deduction-nk/prover.d.ts

@@ -0,0 +1,49 @@
+import { NKFormula, NKProof } from './types';
+/**
+ * API pública: prueba clásica.
+ *
+ * Devuelve un árbol NK que demuestra `goal` a partir de las
+ * `premises` dadas, o `null` si no encontró prueba.
+ */
+export declare function proveClassically(premises: NKFormula[], goal: NKFormula, options?: {
+    budget?: number;
+}): NKProof | null;
+/**
+ * Variante restringida: intenta probar usando sólo reglas
+ * intuicionistas (NJ). Útil internamente para `nkToNJ`.
+ */
+export declare function proveIntuitOnly(premises: NKFormula[], goal: NKFormula, options?: {
+    budget?: number;
+}): NKProof | null;
+/**
+ * Verifica recursivamente el árbol NK. Comprueba cada regla
+ * localmente contra su conclusión y contexto.
+ */
+export declare function verifyProof(proof: NKProof, initialContext?: NKFormula[]): boolean;
+/**
+ * Devuelve una prueba NK de la ley de Peirce: ((P→Q)→P)→P.
+ */
+export declare function provedPeirce(): NKProof;
+/**
+ * Devuelve una prueba NK de la eliminación de doble negación: ¬¬P → P.
+ */
+export declare function provedDNE(): NKProof;
+/**
+ * Devuelve una prueba NK del tercero excluido: P ∨ ¬P.
+ */
+export declare function provedLEM(): NKProof;
+/**
+ * Indica si una prueba NK puede traducirse a NJ sin pérdida.
+ * Si contiene alguna regla puramente clásica, la traducción
+ * falla con `reason`. Si es puramente intuicionista, se
+ * devuelve la prueba intacta (cast estructural a NJProof).
+ *
+ * No intentamos la traducción de Glivenko ni doble-negación
+ * uniforme aquí: el objetivo es detectar si la prueba ya está
+ * en el fragmento intuicionista.
+ */
+export declare function nkToNJ(proof: NKProof): {
+    converted?: NKProof;
+    reason?: string;
+};
+//# sourceMappingURL=prover.d.ts.map

package/dist/logic/profiles/natural-deduction-nk/prover.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover.d.ts","sourceRoot":"","sources":["../../../../src/logic/profiles/natural-deduction-nk/prover.ts"],"names":[],"mappings":"AAqBA,OAAO,EAAE,SAAS,EAAE,OAAO,EAAgC,MAAM,SAAS,CAAC;AA8Q3E;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,SAAS,EAAE,EACrB,IAAI,EAAE,SAAS,EACf,OAAO,GAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAA;CAAO,GAChC,OAAO,GAAG,IAAI,CAGhB;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,QAAQ,EAAE,SAAS,EAAE,EACrB,IAAI,EAAE,SAAS,EACf,OAAO,GAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAA;CAAO,GAChC,OAAO,GAAG,IAAI,CAGhB;AAID;;;GAGG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,cAAc,GAAE,SAAS,EAAO,GAAG,OAAO,CAErF;AAuJD;;GAEG;AACH,wBAAgB,YAAY,IAAI,OAAO,CAatC;AAED;;GAEG;AACH,wBAAgB,SAAS,IAAI,OAAO,CAgBnC;AAED;;GAEG;AACH,wBAAgB,SAAS,IAAI,OAAO,CAUnC;AAID;;;;;;;;;GASG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,OAAO,GAAG;IAAE,SAAS,CAAC,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAU/E"}