@stevenvo780/st-lang 4.2.0 → 4.3.0

package/dist/tests/lambda-calc/lambda-calc.test.js

@@ -0,0 +1,164 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const lambda_calc_1 = require("../../lambda-calc");
+(0, vitest_1.describe)('lambda-calc / sustitución y α', () => {
+    (0, vitest_1.it)('freeVars enumera variables libres respetando binders', () => {
+        // λx. x y   → libres = {y}
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('y')));
+        (0, vitest_1.expect)(Array.from((0, lambda_calc_1.freeVars)(t))).toEqual(['y']);
+    });
+    (0, vitest_1.it)('substitute capture-avoiding: (λy. x)[x := y] → λy#0. y', () => {
+        // El binder `y` choca con la `y` libre del valor sustituido; se debe renombrar.
+        const t = (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('x'));
+        const r = (0, lambda_calc_1.substitute)(t, 'x', (0, lambda_calc_1.v)('y'));
+        (0, vitest_1.expect)(r.kind).toBe('abs');
+        if (r.kind === 'abs') {
+            (0, vitest_1.expect)(r.param).not.toBe('y');
+            // El cuerpo es exactamente la `y` libre original.
+            (0, vitest_1.expect)(r.body).toEqual((0, lambda_calc_1.v)('y'));
+        }
+    });
+    (0, vitest_1.it)('betaStep: (λx.x) y → y', () => {
+        const t = (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y'));
+        const r = (0, lambda_calc_1.betaStep)(t);
+        (0, vitest_1.expect)(r).toEqual((0, lambda_calc_1.v)('y'));
+    });
+    (0, vitest_1.it)('betaStep capture avoidance: (λx.λy.x) y → λz.y (z fresh)', () => {
+        // (λx.λy.x) y debe renombrar el binder interno para no capturar.
+        const t = (0, lambda_calc_1.ap)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('x'))), (0, lambda_calc_1.v)('y'));
+        const r = (0, lambda_calc_1.betaStep)(t);
+        (0, vitest_1.expect)(r).not.toBeNull();
+        if (r === null)
+            return;
+        (0, vitest_1.expect)(r.kind).toBe('abs');
+        if (r.kind === 'abs') {
+            // El binder fue renombrado → ya no se llama 'y'.
+            (0, vitest_1.expect)(r.param).not.toBe('y');
+            // Y el cuerpo es la `y` libre, no la antigua ligada.
+            (0, vitest_1.expect)(r.body).toEqual((0, lambda_calc_1.v)('y'));
+        }
+        // α-equivalente a λz.y.
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(r, (0, lambda_calc_1.lam)('z', (0, lambda_calc_1.v)('y')))).toBe(true);
+    });
+});
+(0, vitest_1.describe)('lambda-calc / β-reducción y estrategias', () => {
+    (0, vitest_1.it)('normalize(SKK) →* I (módulo α)', () => {
+        const term = (0, lambda_calc_1.apN)(lambda_calc_1.S, lambda_calc_1.K, lambda_calc_1.K);
+        const { result, terminated } = (0, lambda_calc_1.normalize)(term);
+        (0, vitest_1.expect)(terminated).toBe(true);
+        // SKK es la implementación clásica de I.
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(result, lambda_calc_1.I)).toBe(true);
+    });
+    (0, vitest_1.it)('normalize(omega) no termina: maxSteps agotado y terminated=false', () => {
+        const { steps, terminated } = (0, lambda_calc_1.normalize)(lambda_calc_1.omega, { maxSteps: 100 });
+        (0, vitest_1.expect)(terminated).toBe(false);
+        (0, vitest_1.expect)(steps).toBe(100);
+    });
+    (0, vitest_1.it)('cbn termina en weak-head normal form, no entra bajo λ', () => {
+        // λz. (λx.x) z  — bajo cbn es ya WHNF (no reduce bajo lambda).
+        const t = (0, lambda_calc_1.lam)('z', (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('z')));
+        const { result, terminated } = (0, lambda_calc_1.normalize)(t, { strategy: 'cbn', maxSteps: 50 });
+        (0, vitest_1.expect)(terminated).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)(result)).toBe(true);
+        // No se reduce: el redex interno queda intacto.
+        (0, vitest_1.expect)(result.kind).toBe('abs');
+        if (result.kind === 'abs') {
+            (0, vitest_1.expect)(result.body.kind).toBe('app');
+        }
+    });
+    (0, vitest_1.it)('cbv reduce argumentos antes de aplicar — (λx.y) ((λw.w) z) →* y', () => {
+        // El argumento se reduce primero pero al final el lambda lo descarta.
+        const t = (0, lambda_calc_1.ap)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('y')), (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('z')));
+        const { result, terminated } = (0, lambda_calc_1.normalize)(t, { strategy: 'cbv', maxSteps: 50 });
+        (0, vitest_1.expect)(terminated).toBe(true);
+        (0, vitest_1.expect)(result).toEqual((0, lambda_calc_1.v)('y'));
+    });
+    (0, vitest_1.it)('leftmost-innermost vs outermost: ambos preservan ((λx.x) y) → y en este caso', () => {
+        const t = (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y'));
+        (0, vitest_1.expect)((0, lambda_calc_1.betaStep)(t, 'leftmost-outermost')).toEqual((0, lambda_calc_1.v)('y'));
+        (0, vitest_1.expect)((0, lambda_calc_1.betaStep)(t, 'leftmost-innermost')).toEqual((0, lambda_calc_1.v)('y'));
+    });
+    (0, vitest_1.it)('isNormalForm distingue normal de redex', () => {
+        (0, vitest_1.expect)((0, lambda_calc_1.isNormalForm)((0, lambda_calc_1.v)('x'))).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.isNormalForm)(lambda_calc_1.I)).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.isNormalForm)((0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y')))).toBe(false);
+    });
+    (0, vitest_1.it)('isWeakHeadNormalForm: λ y aplicación var-headed son WHNF; redex no', () => {
+        (0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)(lambda_calc_1.I)).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)((0, lambda_calc_1.ap)((0, lambda_calc_1.v)('f'), (0, lambda_calc_1.v)('y')))).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)((0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y')))).toBe(false);
+    });
+});
+(0, vitest_1.describe)('lambda-calc / η-reducción', () => {
+    (0, vitest_1.it)('etaStep: (λx. f x) → f cuando x ∉ FV(f)', () => {
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('f'), (0, lambda_calc_1.v)('x')));
+        (0, vitest_1.expect)((0, lambda_calc_1.etaStep)(t)).toEqual((0, lambda_calc_1.v)('f'));
+    });
+    (0, vitest_1.it)('etaStep NO aplica cuando x ∈ FV(f): (λx. x x) se queda igual', () => {
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('x')));
+        (0, vitest_1.expect)((0, lambda_calc_1.etaStep)(t)).toBeNull();
+    });
+});
+(0, vitest_1.describe)('lambda-calc / Church numerals', () => {
+    (0, vitest_1.it)('churchNumeral(0..3) son normalmente decodificables', () => {
+        for (let n = 0; n <= 3; n += 1) {
+            (0, vitest_1.expect)((0, lambda_calc_1.decodeChurch)((0, lambda_calc_1.churchNumeral)(n))).toBe(n);
+        }
+    });
+    (0, vitest_1.it)('SUCC: succ(2̄) →* 3̄', () => {
+        const term = (0, lambda_calc_1.ap)(lambda_calc_1.churchSucc, (0, lambda_calc_1.churchNumeral)(2));
+        (0, vitest_1.expect)((0, lambda_calc_1.evalChurch)(term)).toBe(3);
+    });
+    (0, vitest_1.it)('ADD: 2 + 3 →* 5', () => {
+        const term = (0, lambda_calc_1.apN)(lambda_calc_1.churchAdd, (0, lambda_calc_1.churchNumeral)(2), (0, lambda_calc_1.churchNumeral)(3));
+        (0, vitest_1.expect)((0, lambda_calc_1.evalChurch)(term)).toBe(5);
+    });
+    (0, vitest_1.it)('MUL: 3 * 4 →* 12', () => {
+        const term = (0, lambda_calc_1.apN)(lambda_calc_1.churchMul, (0, lambda_calc_1.churchNumeral)(3), (0, lambda_calc_1.churchNumeral)(4));
+        (0, vitest_1.expect)((0, lambda_calc_1.evalChurch)(term)).toBe(12);
+    });
+    (0, vitest_1.it)('decodeChurch devuelve null para términos que no son numerales', () => {
+        // y libre, no es Church numeral.
+        (0, vitest_1.expect)((0, lambda_calc_1.decodeChurch)((0, lambda_calc_1.v)('y'))).toBeNull();
+        // Función pero no tiene la forma λf.λx. f^n x.
+        (0, vitest_1.expect)((0, lambda_calc_1.decodeChurch)((0, lambda_calc_1.lam)('f', (0, lambda_calc_1.v)('x')))).toBeNull();
+    });
+});
+(0, vitest_1.describe)('lambda-calc / utilidades', () => {
+    (0, vitest_1.it)('alphaEq detecta equivalencia y rechaza diferencias estructurales', () => {
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('x')), (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('y')))).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('x')), (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('y')))).toBe(false);
+        // Variables libres con nombres distintos NO son α-equivalentes.
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('y'))).toBe(false);
+    });
+    (0, vitest_1.it)('alphaRename produce términos α-equivalentes al original', () => {
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('y'))));
+        const supply = (0, lambda_calc_1.makeFreshSupply)();
+        const renamed = (0, lambda_calc_1.alphaRename)(t, supply);
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(t, renamed)).toBe(true);
+        // Y los binders quedaron con los nombres frescos.
+        if (renamed.kind === 'abs') {
+            (0, vitest_1.expect)(renamed.param).toMatch(/^_x\d+$/);
+        }
+    });
+    (0, vitest_1.it)('termToString produce algo legible para combinadores', () => {
+        (0, vitest_1.expect)((0, lambda_calc_1.termToString)(lambda_calc_1.I)).toBe('(λx.x)');
+        (0, vitest_1.expect)((0, lambda_calc_1.termToString)((0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y')))).toBe('((λx.x) y)');
+    });
+    (0, vitest_1.it)('Y-combinator es un punto fijo: Y f →* f (Y f)  (1 paso de unfolding bajo cbn)', () => {
+        // Bajo cbn, Y f hace UN paso β y revela la forma f ((λx.f(xx))(λx.f(xx))).
+        const term = (0, lambda_calc_1.ap)(lambda_calc_1.Y, (0, lambda_calc_1.v)('f'));
+        const next = (0, lambda_calc_1.betaStep)(term);
+        (0, vitest_1.expect)(next).not.toBeNull();
+        if (next === null)
+            return;
+        // El primer paso debe producir (λx. f (x x)) (λx. f (x x)).
+        (0, vitest_1.expect)(next.kind).toBe('app');
+        if (next.kind === 'app') {
+            // La cabeza es λx. f (x x).
+            (0, vitest_1.expect)(next.fn.kind).toBe('abs');
+        }
+    });
+});
+//# sourceMappingURL=lambda-calc.test.js.map

package/dist/tests/lambda-calc/lambda-calc.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lambda-calc.test.js","sourceRoot":"","sources":["../../../src/tests/lambda-calc/lambda-calc.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,mDA4B2B;AAE3B,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,2BAA2B;QAC3B,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAK,CAAC,IAAI,CAAC,IAAA,sBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,gFAAgF;QAChF,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAA,wBAAU,EAAC,CAAC,EAAE,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,kDAAkD;YAClD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,IAAA,sBAAQ,EAAC,CAAC,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,iEAAiE;QACjE,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,IAAA,sBAAQ,EAAC,CAAC,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO;QACvB,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,iDAAiD;YACjD,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,qDAAqD;YACrD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,wBAAwB;QACxB,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,eAAC,EAAE,eAAC,EAAE,eAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,yCAAyC;QACzC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,MAAM,EAAE,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,mBAAK,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,+DAA+D;QAC/D,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/E,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,gDAAgD;QAChD,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC1B,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,sEAAsE;QACtE,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/E,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAChC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,IAAI,GAAG,IAAA,gBAAE,EAAC,wBAAU,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,wBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iBAAiB,EAAE,GAAG,EAAE;QACzB,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,uBAAS,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,IAAA,wBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kBAAkB,EAAE,GAAG,EAAE;QAC1B,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,uBAAS,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,IAAA,wBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,iCAAiC;QACjC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QACxC,+CAA+C;QAC/C,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChE,gEAAgE;QAChE,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,6BAAe,GAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAA,yBAAW,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,kDAAkD;QAClD,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+EAA+E,EAAE,GAAG,EAAE;QACvF,2EAA2E;QAC3E,MAAM,IAAI,GAAG,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAA,sBAAQ,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,4DAA4D;QAC5D,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACxB,4BAA4B;YAC5B,IAAA,eAAM,EAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/many-valued/many-valued.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=many-valued.test.d.ts.map

package/dist/tests/many-valued/many-valued.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"many-valued.test.d.ts","sourceRoot":"","sources":["../../../src/tests/many-valued/many-valued.test.ts"],"names":[],"mappings":""}

package/dist/tests/many-valued/many-valued.test.js

@@ -0,0 +1,150 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const many_valued_1 = require("../../profiles/many-valued");
+const P = (0, many_valued_1.atom)('P');
+const Q = (0, many_valued_1.atom)('Q');
+(0, vitest_1.describe)('many-valued logics — núcleo de evaluación', () => {
+    (0, vitest_1.it)('Łukasiewicz: P → P es tautología', () => {
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)(P, P), 'lukasiewicz')).toBe(true);
+    });
+    (0, vitest_1.it)('Łukasiewicz (strong OR): P ∨ ¬P SÍ es tautología vía s-norm min(1, p+(1-p))=1', () => {
+        // Con la disyunción fuerte (s-norm), P ∨ ¬P se colapsa a 1 siempre.
+        // Es Gödel/Producto quienes rompen el tercero excluido — ver tests abajo.
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), 'lukasiewicz')).toBe(true);
+        const v = (0, many_valued_1.evaluate)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), { P: 0.5 }, 'lukasiewicz');
+        (0, vitest_1.expect)(v).toBeCloseTo(1, 9); // min(1, 0.5+0.5)=1
+    });
+    (0, vitest_1.it)('Łukasiewicz: P ∧ ¬P NO siempre 0 — pero ¬(P ∧ ¬P) sí es tautología', () => {
+        // En Łukasiewicz, P ∧ ¬P = max(0, P + (1-P) - 1) = max(0, 0) = 0
+        // Así que ¬(P ∧ ¬P) sí es tautología (es la "no-contradicción").
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.not)((0, many_valued_1.and)(P, (0, many_valued_1.not)(P))), 'lukasiewicz')).toBe(true);
+        (0, vitest_1.expect)((0, many_valued_1.isContradiction)((0, many_valued_1.and)(P, (0, many_valued_1.not)(P)), 'lukasiewicz')).toBe(true);
+    });
+    (0, vitest_1.it)('Gödel: P ∨ ¬P NO es tautología', () => {
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), 'godel')).toBe(false);
+        // Cuando P=0.5: ¬P=0 (porque P≠0), entonces max(0.5, 0)=0.5
+        const v = (0, many_valued_1.evaluate)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), { P: 0.5 }, 'godel');
+        (0, vitest_1.expect)(v).toBeCloseTo(0.5, 9);
+    });
+    (0, vitest_1.it)('Gödel: P → P es tautología', () => {
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)(P, P), 'godel')).toBe(true);
+    });
+    (0, vitest_1.it)('Gödel: P ∧ P = P (t-norm idempotente)', () => {
+        for (const p of [0, 0.25, 0.5, 0.75, 1]) {
+            (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.and)(P, P), { P: p }, 'godel')).toBeCloseTo(p, 9);
+        }
+    });
+    (0, vitest_1.it)('Producto: P ∧ P puede ser strictly menor que P (P=0.5 → 0.25)', () => {
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.and)(P, P), { P: 0.5 }, 'product')).toBeCloseTo(0.25, 9);
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.and)(P, P), { P: 0.3 }, 'product')).toBeCloseTo(0.09, 9);
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.and)(P, P), { P: 1 }, 'product')).toBeCloseTo(1, 9);
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.and)(P, P), { P: 0 }, 'product')).toBeCloseTo(0, 9);
+    });
+    (0, vitest_1.it)('Producto: P → P es tautología y P → Q vale q/p cuando p>q', () => {
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)(P, P), 'product')).toBe(true);
+        // P=0.8, Q=0.2 → q/p = 0.25
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), { P: 0.8, Q: 0.2 }, 'product')).toBeCloseTo(0.25, 9);
+        // P=0.2, Q=0.8 → 1 (porque p<=q)
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), { P: 0.2, Q: 0.8 }, 'product')).toBeCloseTo(1, 9);
+    });
+    (0, vitest_1.it)('Comparación: P ∧ Q con P=0.6, Q=0.4 da distinto en cada sistema', () => {
+        const env = { P: 0.6, Q: 0.4 };
+        const luka = (0, many_valued_1.evaluate)((0, many_valued_1.and)(P, Q), env, 'lukasiewicz');
+        const godel = (0, many_valued_1.evaluate)((0, many_valued_1.and)(P, Q), env, 'godel');
+        const prod = (0, many_valued_1.evaluate)((0, many_valued_1.and)(P, Q), env, 'product');
+        // Łukasiewicz: max(0, 0.6+0.4-1)=0
+        (0, vitest_1.expect)(luka).toBeCloseTo(0, 9);
+        // Gödel: min(0.6, 0.4)=0.4
+        (0, vitest_1.expect)(godel).toBeCloseTo(0.4, 9);
+        // Product: 0.6*0.4=0.24
+        (0, vitest_1.expect)(prod).toBeCloseTo(0.24, 9);
+        (0, vitest_1.expect)(luka).not.toBeCloseTo(godel, 2);
+        (0, vitest_1.expect)(godel).not.toBeCloseTo(prod, 2);
+    });
+    (0, vitest_1.it)('Comparación de implicación: P=0.6, Q=0.4 (p>q)', () => {
+        const env = { P: 0.6, Q: 0.4 };
+        // Łukasiewicz: min(1, 1-0.6+0.4)=0.8
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'lukasiewicz')).toBeCloseTo(0.8, 9);
+        // Gödel: p>q → 0.4
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'godel')).toBeCloseTo(0.4, 9);
+        // Product: q/p = 0.4/0.6 ≈ 0.6667
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'product')).toBeCloseTo(2 / 3, 9);
+    });
+    (0, vitest_1.it)('Łukasiewicz: negación involutiva ¬¬P = P es tautología modal', () => {
+        // En la rejilla, ¬¬P debe coincidir con P; expresado como
+        // (¬¬P → P) ∧ (P → ¬¬P) ambas deben ser tautologías.
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)((0, many_valued_1.not)((0, many_valued_1.not)(P)), P), 'lukasiewicz')).toBe(true);
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)(P, (0, many_valued_1.not)((0, many_valued_1.not)(P))), 'lukasiewicz')).toBe(true);
+    });
+    (0, vitest_1.it)('Gödel/Product: ¬¬P ≠ P (negación no involutiva)', () => {
+        // En Gödel/Product, ¬0.5 = 0 → ¬¬0.5 = 1, distinto de 0.5.
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.not)((0, many_valued_1.not)(P)), { P: 0.5 }, 'godel')).toBeCloseTo(1, 9);
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.not)((0, many_valued_1.not)(P)), { P: 0.5 }, 'product')).toBeCloseTo(1, 9);
+        // por tanto (¬¬P → P) NO es tautología
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)((0, many_valued_1.not)((0, many_valued_1.not)(P)), P), 'godel')).toBe(false);
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)((0, many_valued_1.not)((0, many_valued_1.not)(P)), P), 'product')).toBe(false);
+    });
+    (0, vitest_1.it)('Modus ponens (P ∧ (P → Q)) → Q es tautología en los 3 sistemas', () => {
+        const mp = (0, many_valued_1.implies)((0, many_valued_1.and)(P, (0, many_valued_1.implies)(P, Q)), Q);
+        for (const sys of ['lukasiewicz', 'godel', 'product']) {
+            (0, vitest_1.expect)((0, many_valued_1.isTautology)(mp, sys)).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('findValuation: P ∨ ¬P en Łukasiewicz no tiene contraejemplo (s-norm fuerte)', () => {
+        // En Łukasiewicz strong, P∨¬P = min(1, P+1-P)=1 siempre.
+        const v = (0, many_valued_1.findValuation)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), 'lukasiewicz', 0.5);
+        (0, vitest_1.expect)(v).toBeNull();
+    });
+    (0, vitest_1.it)('findValuation encuentra contraejemplo de P ∨ ¬P en Gödel', () => {
+        const v = (0, many_valued_1.findValuation)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), 'godel', 0.5);
+        // P=0.5 → ¬P=0 → max=0.5
+        (0, vitest_1.expect)(v).not.toBeNull();
+        if (v) {
+            (0, vitest_1.expect)(v.P).toBeCloseTo(0.5, 6);
+        }
+    });
+    (0, vitest_1.it)('isContradiction: 0 sólo es 0 — P ∧ ¬P es contradicción en Łukasiewicz', () => {
+        (0, vitest_1.expect)((0, many_valued_1.isContradiction)((0, many_valued_1.and)(P, (0, many_valued_1.not)(P)), 'lukasiewicz')).toBe(true);
+    });
+    (0, vitest_1.it)('collectFuzzyAtoms recoge átomos únicos y ordenados', () => {
+        const f = (0, many_valued_1.and)(P, (0, many_valued_1.or)(Q, (0, many_valued_1.not)((0, many_valued_1.atom)('R'))));
+        (0, vitest_1.expect)((0, many_valued_1.collectFuzzyAtoms)(f)).toEqual(['P', 'Q', 'R']);
+    });
+    (0, vitest_1.it)('evaluate clamp01: entradas fuera de [0,1] se clampean', () => {
+        // env con valor 2 — el evaluator clampea a 1.
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)(P, { P: 2 }, 'lukasiewicz')).toBeCloseTo(1, 9);
+        (0, vitest_1.expect)((0, many_valued_1.evaluate)(P, { P: -0.5 }, 'product')).toBeCloseTo(0, 9);
+    });
+    (0, vitest_1.it)('Casos extremos 0/1: comportamiento clásico recuperado', () => {
+        // Cuando P,Q ∈ {0,1}, las 3 lógicas degeneran a clásica.
+        for (const p of [0, 1]) {
+            for (const q of [0, 1]) {
+                const env = { P: p, Q: q };
+                const luka = (0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'lukasiewicz');
+                const god = (0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'godel');
+                const prod = (0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'product');
+                const classical = p === 1 && q === 0 ? 0 : 1;
+                (0, vitest_1.expect)(luka).toBeCloseTo(classical, 9);
+                (0, vitest_1.expect)(god).toBeCloseTo(classical, 9);
+                (0, vitest_1.expect)(prod).toBeCloseTo(classical, 9);
+            }
+        }
+    });
+    (0, vitest_1.it)('Łukasiewicz: (P → Q) ∨ (Q → P) — prelinearity / Dummett', () => {
+        // Es tautología en los 3 sistemas (axioma común de las lógicas de Hájek).
+        const dum = (0, many_valued_1.or)((0, many_valued_1.implies)(P, Q), (0, many_valued_1.implies)(Q, P));
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)(dum, 'lukasiewicz')).toBe(true);
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)(dum, 'godel')).toBe(true);
+        (0, vitest_1.expect)((0, many_valued_1.isTautology)(dum, 'product')).toBe(true);
+    });
+    (0, vitest_1.it)('Producto: P ∧ Q = P*Q (t-norm conmutativo y asociativo)', () => {
+        const env1 = { P: 0.5, Q: 0.4 };
+        const env2 = { P: 0.4, Q: 0.5 };
+        const v1 = (0, many_valued_1.evaluate)((0, many_valued_1.and)(P, Q), env1, 'product');
+        const v2 = (0, many_valued_1.evaluate)((0, many_valued_1.and)(P, Q), env2, 'product');
+        (0, vitest_1.expect)(v1).toBeCloseTo(v2, 9);
+        (0, vitest_1.expect)(v1).toBeCloseTo(0.2, 9);
+    });
+});
+//# sourceMappingURL=many-valued.test.js.map

package/dist/tests/many-valued/many-valued.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"many-valued.test.js","sourceRoot":"","sources":["../../../src/tests/many-valued/many-valued.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,4DAYoC;AAEpC,MAAM,CAAC,GAAG,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC;AACpB,MAAM,CAAC,GAAG,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC;AAEpB,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+EAA+E,EAAE,GAAG,EAAE;QACvF,oEAAoE;QACpE,0EAA0E;QAC1E,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7D,MAAM,CAAC,GAAG,IAAA,sBAAQ,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,aAAa,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,oBAAoB;IACnD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,iEAAiE;QACjE,iEAAiE;QACjE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,IAAA,6BAAe,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,4DAA4D;QAC5D,MAAM,CAAC,GAAG,IAAA,sBAAQ,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,OAAO,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YACxC,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnE,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzD,4BAA4B;QAC5B,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CACxE,IAAI,EACJ,CAAC,CACF,CAAC;QACF,iCAAiC;QACjC,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CACxE,CAAC,EACD,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;QAEjD,mCAAmC;QACnC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/B,2BAA2B;QAC3B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClC,wBAAwB;QACxB,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAElC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;QAC/B,qCAAqC;QACrC,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACxE,mBAAmB;QACnB,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClE,kCAAkC;QAClC,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,0DAA0D;QAC1D,qDAAqD;QACrD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,2DAA2D;QAC3D,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvE,uCAAuC;QACvC,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,EAAE,GAAG,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,KAAK,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAoB,EAAE,CAAC;YACzE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6EAA6E,EAAE,GAAG,EAAE;QACrF,yDAAyD;QACzD,MAAM,CAAC,GAAG,IAAA,2BAAa,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,CAAC,GAAG,IAAA,2BAAa,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;QACrD,yBAAyB;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,EAAE,CAAC;YACN,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,IAAA,eAAM,EAAC,IAAA,6BAAe,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,CAAC,EAAE,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,+BAAiB,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,8CAA8C;QAC9C,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,yDAAyD;QACzD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACvB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACvB,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;gBACzD,MAAM,GAAG,GAAG,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;gBAClD,MAAM,IAAI,GAAG,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;gBACrD,MAAM,SAAS,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7C,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;gBACvC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;gBACtC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,0EAA0E;QAC1E,MAAM,GAAG,GAAG,IAAA,gBAAE,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;QAChC,MAAM,EAAE,GAAG,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QAChD,MAAM,EAAE,GAAG,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/modal-frame-axioms/frame-axioms.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=frame-axioms.test.d.ts.map

package/dist/tests/modal-frame-axioms/frame-axioms.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"frame-axioms.test.d.ts","sourceRoot":"","sources":["../../../src/tests/modal-frame-axioms/frame-axioms.test.ts"],"names":[],"mappings":""}

package/dist/tests/modal-frame-axioms/frame-axioms.test.js

@@ -0,0 +1,236 @@
+"use strict";
+// ============================================================
+// Tests del tableau modal con axiomas de frame
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const modal_frame_axioms_1 = require("../../profiles/modal-frame-axioms");
+const p = (0, modal_frame_axioms_1.atom)('p');
+const q = (0, modal_frame_axioms_1.atom)('q');
+// ------------------------------------------------------------
+// Sistemas y composición
+// ------------------------------------------------------------
+(0, vitest_1.describe)('systemAxioms — composición de sistemas estándar', () => {
+    (0, vitest_1.it)('K no tiene axiomas de frame', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.systemAxioms)('K')).toEqual([]);
+    });
+    (0, vitest_1.it)('T = {T}', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.systemAxioms)('T').sort()).toEqual(['T']);
+    });
+    (0, vitest_1.it)('S4 = {T, 4}', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.systemAxioms)('S4').sort()).toEqual(['4', 'T']);
+    });
+    (0, vitest_1.it)('S5 = {T, 4, 5}', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.systemAxioms)('S5').sort()).toEqual(['4', '5', 'T']);
+    });
+    (0, vitest_1.it)('B = {T, B}', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.systemAxioms)('B').sort()).toEqual(['B', 'T']);
+    });
+    (0, vitest_1.it)('KD45 = {D, 4, 5}', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.systemAxioms)('KD45').sort()).toEqual(['4', '5', 'D']);
+    });
+});
+// ------------------------------------------------------------
+// Cada axioma es válido en su sistema mínimo y refutable en K
+// ------------------------------------------------------------
+(0, vitest_1.describe)('axiomas individuales — válidos en su sistema, no en K', () => {
+    const cases = [
+        { axiom: 'T', system: 'T' },
+        { axiom: '4', system: 'K4' },
+        { axiom: '5', system: 'K5' },
+        { axiom: 'B', system: 'B' },
+        { axiom: 'D', system: 'D' },
+    ];
+    for (const { axiom, system } of cases) {
+        (0, vitest_1.it)(`axioma ${axiom} válido en ${system}`, () => {
+            (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.axiomFormula)(axiom, p), system)).toBe(true);
+        });
+        (0, vitest_1.it)(`axioma ${axiom} NO válido en K`, () => {
+            (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.axiomFormula)(axiom, p), 'K')).toBe(false);
+        });
+    }
+});
+// ------------------------------------------------------------
+// Axiomas característicos canónicos por sistema
+// ------------------------------------------------------------
+(0, vitest_1.describe)('S4 — reflexivo + transitivo', () => {
+    (0, vitest_1.it)('□p → □□p es válido (axioma 4)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.box)(p))), 'S4')).toBe(true);
+    });
+    (0, vitest_1.it)('□p → p es válido (axioma T)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), p), 'S4')).toBe(true);
+    });
+    (0, vitest_1.it)('◇◇p → ◇p es válido (densidad bajo trans)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.diamond)((0, modal_frame_axioms_1.diamond)(p)), (0, modal_frame_axioms_1.diamond)(p)), 'S4')).toBe(true);
+    });
+    (0, vitest_1.it)('◇p → □◇p NO es válido (axioma 5 no se cumple en S4)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.diamond)(p), (0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.diamond)(p))), 'S4')).toBe(false);
+    });
+});
+(0, vitest_1.describe)('S5 — equivalencia', () => {
+    (0, vitest_1.it)('◇p → □◇p es válido (axioma 5)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.diamond)(p), (0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.diamond)(p))), 'S5')).toBe(true);
+    });
+    (0, vitest_1.it)('p → □◇p es válido (axioma B)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)(p, (0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.diamond)(p))), 'S5')).toBe(true);
+    });
+    (0, vitest_1.it)('□p ↔ ¬◇¬p, formulado como □p → ¬◇¬p, válido', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.not)((0, modal_frame_axioms_1.diamond)((0, modal_frame_axioms_1.not)(p)))), 'S5')).toBe(true);
+    });
+    (0, vitest_1.it)('◇□p → p es válido (resultado clásico S5)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.diamond)((0, modal_frame_axioms_1.box)(p)), p), 'S5')).toBe(true);
+    });
+    (0, vitest_1.it)('◇□p → □p es válido en S5 pero no en S4', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.diamond)((0, modal_frame_axioms_1.box)(p)), (0, modal_frame_axioms_1.box)(p)), 'S5')).toBe(true);
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.diamond)((0, modal_frame_axioms_1.box)(p)), (0, modal_frame_axioms_1.box)(p)), 'S4')).toBe(false);
+    });
+});
+(0, vitest_1.describe)('T — reflexividad', () => {
+    (0, vitest_1.it)('□p → p es válido en T', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), p), 'T')).toBe(true);
+    });
+    (0, vitest_1.it)('p → ◇p es válido en T (dual de T)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)(p, (0, modal_frame_axioms_1.diamond)(p)), 'T')).toBe(true);
+    });
+    (0, vitest_1.it)('□p → ◇p es válido en T (refl ⇒ serial)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.diamond)(p)), 'T')).toBe(true);
+    });
+    (0, vitest_1.it)('□p → □□p NO es válido en T (no hay transitividad)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.box)(p))), 'T')).toBe(false);
+    });
+});
+(0, vitest_1.describe)('K — sin axiomas de frame', () => {
+    (0, vitest_1.it)('□p → p NO es válido en K', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), p), 'K')).toBe(false);
+    });
+    (0, vitest_1.it)('□p → ◇p NO es válido en K (sin D)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.diamond)(p)), 'K')).toBe(false);
+    });
+    (0, vitest_1.it)('axioma K válido: □(p→q) → (□p→□q)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.implies)(p, q)), (0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.box)(q))), 'K')).toBe(true);
+    });
+    (0, vitest_1.it)('necesitación: □(p ∨ ¬p) válido en cualquier sistema normal', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.or)(p, (0, modal_frame_axioms_1.not)(p))), 'K')).toBe(true);
+    });
+});
+(0, vitest_1.describe)('D — serialidad', () => {
+    (0, vitest_1.it)('□p → ◇p es válido en D', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.diamond)(p)), 'D')).toBe(true);
+    });
+    (0, vitest_1.it)('¬(□p ∧ □¬p) es válido en D (consistencia normativa)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.not)((0, modal_frame_axioms_1.and)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.not)(p)))), 'D')).toBe(true);
+    });
+    (0, vitest_1.it)('□p → p NO es válido en D (D no implica T)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), p), 'D')).toBe(false);
+    });
+});
+(0, vitest_1.describe)('B — simetría (KTB)', () => {
+    (0, vitest_1.it)('p → □◇p válido en B (axioma B)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)(p, (0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.diamond)(p))), 'B')).toBe(true);
+    });
+    (0, vitest_1.it)('◇□p → p válido en B', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.diamond)((0, modal_frame_axioms_1.box)(p)), p), 'B')).toBe(true);
+    });
+    (0, vitest_1.it)('□p → □□p NO válido en B (sin transitividad)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.box)(p))), 'B')).toBe(false);
+    });
+});
+(0, vitest_1.describe)('KD45 — lógica doxástica estándar', () => {
+    (0, vitest_1.it)('axioma D válido: □p → ◇p', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.axiomFormula)('D', p), 'KD45')).toBe(true);
+    });
+    (0, vitest_1.it)('axioma 4 válido: □p → □□p (positive introspection)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.axiomFormula)('4', p), 'KD45')).toBe(true);
+    });
+    (0, vitest_1.it)('axioma 5 válido: ◇p → □◇p (negative introspection)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.axiomFormula)('5', p), 'KD45')).toBe(true);
+    });
+    (0, vitest_1.it)('□p → p NO válido en KD45 (creencia ≠ verdad)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), p), 'KD45')).toBe(false);
+    });
+});
+// ------------------------------------------------------------
+// Tableau directo y modelos
+// ------------------------------------------------------------
+(0, vitest_1.describe)('tableauWithAxioms — devuelve modelo cuando es satisfacible', () => {
+    (0, vitest_1.it)('p satisfacible en K — modelo con w0 forzando p', () => {
+        const r = (0, modal_frame_axioms_1.tableauWithAxioms)(p, []);
+        (0, vitest_1.expect)(r.sat).toBe(true);
+        (0, vitest_1.expect)(r.model).toBeDefined();
+        (0, vitest_1.expect)(r.model.valuation.get(r.model.actual)?.has('p')).toBe(true);
+    });
+    (0, vitest_1.it)('□p ∧ ¬p satisfacible en K (irreflexivo) — closed=false', () => {
+        const r = (0, modal_frame_axioms_1.tableauWithAxioms)((0, modal_frame_axioms_1.and)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.not)(p)), []);
+        (0, vitest_1.expect)(r.sat).toBe(true);
+        (0, vitest_1.expect)(r.closed).toBe(false);
+    });
+    (0, vitest_1.it)('□p ∧ ¬p insatisfacible en T (reflexivo) — closed=true', () => {
+        const r = (0, modal_frame_axioms_1.tableauWithAxioms)((0, modal_frame_axioms_1.and)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.not)(p)), ['T']);
+        (0, vitest_1.expect)(r.sat).toBe(false);
+        (0, vitest_1.expect)(r.closed).toBe(true);
+        (0, vitest_1.expect)(r.model).toBeUndefined();
+    });
+    (0, vitest_1.it)('contradicción proposicional cierra en cualquier sistema', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.tableauWithAxioms)((0, modal_frame_axioms_1.and)(p, (0, modal_frame_axioms_1.not)(p)), []).closed).toBe(true);
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.tableauWithAxioms)((0, modal_frame_axioms_1.and)(p, (0, modal_frame_axioms_1.not)(p)), ['T']).closed).toBe(true);
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.tableauWithAxioms)((0, modal_frame_axioms_1.and)(p, (0, modal_frame_axioms_1.not)(p)), ['T', '4', '5']).closed).toBe(true);
+    });
+});
+// ------------------------------------------------------------
+// Composición / monotonía: T-validez ⊆ S4-validez ⊆ S5-validez
+// ------------------------------------------------------------
+(0, vitest_1.describe)('monotonía: añadir axiomas no quita validez', () => {
+    const formulas = [
+        (0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), p), // T-válido
+        (0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.box)(p))), // 4-válido
+        (0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.diamond)(p)), // T,D-válido
+    ];
+    for (const phi of formulas) {
+        (0, vitest_1.it)(`si φ válida en T también lo es en S4 y S5`, () => {
+            if ((0, modal_frame_axioms_1.isValid)(phi, 'T')) {
+                (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)(phi, 'S4')).toBe(true);
+                (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)(phi, 'S5')).toBe(true);
+            }
+        });
+    }
+});
+// ------------------------------------------------------------
+// Casos negativos: claras refutaciones
+// ------------------------------------------------------------
+(0, vitest_1.describe)('refutaciones explícitas', () => {
+    (0, vitest_1.it)('p → □p NO válido en S5 (sólo si universal)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)(p, (0, modal_frame_axioms_1.box)(p)), 'S5')).toBe(false);
+    });
+    (0, vitest_1.it)('◇p → p NO válido en T (T no da simetría)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.diamond)(p), p), 'T')).toBe(false);
+    });
+    (0, vitest_1.it)('□◇p → ◇□p NO válido en S4 (McKinsey no es teorema)', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)((0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)((0, modal_frame_axioms_1.diamond)(p)), (0, modal_frame_axioms_1.diamond)((0, modal_frame_axioms_1.box)(p))), 'S4')).toBe(false);
+    });
+});
+// ------------------------------------------------------------
+// isSatisfiable directo
+// ------------------------------------------------------------
+(0, vitest_1.describe)('isSatisfiable — consistencia con isValid', () => {
+    (0, vitest_1.it)('p satisfacible en todos los sistemas', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isSatisfiable)(p, 'K')).toBe(true);
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isSatisfiable)(p, 'T')).toBe(true);
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isSatisfiable)(p, 'S5')).toBe(true);
+    });
+    (0, vitest_1.it)('p ∧ ¬p insatisfacible en todos los sistemas', () => {
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isSatisfiable)((0, modal_frame_axioms_1.and)(p, (0, modal_frame_axioms_1.not)(p)), 'K')).toBe(false);
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isSatisfiable)((0, modal_frame_axioms_1.and)(p, (0, modal_frame_axioms_1.not)(p)), 'KD45')).toBe(false);
+    });
+    (0, vitest_1.it)('isValid(φ) ⇔ ¬isSatisfiable(¬φ)', () => {
+        const phi = (0, modal_frame_axioms_1.implies)((0, modal_frame_axioms_1.box)(p), p);
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)(phi, 'T')).toBe(!(0, modal_frame_axioms_1.isSatisfiable)((0, modal_frame_axioms_1.not)(phi), 'T'));
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isValid)(phi, 'K')).toBe(!(0, modal_frame_axioms_1.isSatisfiable)((0, modal_frame_axioms_1.not)(phi), 'K'));
+    });
+    (0, vitest_1.it)('□p ∧ ¬p satisfacible en K (mundo aislado), insatisfacible en T', () => {
+        const phi = (0, modal_frame_axioms_1.and)((0, modal_frame_axioms_1.box)(p), (0, modal_frame_axioms_1.not)(p));
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isSatisfiable)(phi, 'K')).toBe(true);
+        // En T (reflexividad) w0 R w0, entonces □p fuerza p(w0), contradicción.
+        (0, vitest_1.expect)((0, modal_frame_axioms_1.isSatisfiable)(phi, 'T')).toBe(false);
+    });
+});
+//# sourceMappingURL=frame-axioms.test.js.map