@stevenvo780/st-lang 4.11.0 → 4.12.0

package/dist/reasoning/set-theory/hf-sets.js

@@ -0,0 +1,338 @@
+"use strict";
+/**
+ * Hereditarily finite sets (the universe Vω).
+ *
+ * Every HF set is built from the empty set in finitely many steps using
+ * pairing and union. Equality is extensional: two sets are equal iff they
+ * have the same elements, regardless of order or repetition.
+ *
+ * Internally we keep elements as a plain array; the canonical form (used
+ * for hashing/equality) deduplicates and orders by a recursive serialization.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EMPTY = void 0;
+exports.canonicalize = canonicalize;
+exports.setEquals = setEquals;
+exports.isElement = isElement;
+exports.isSubset = isSubset;
+exports.cardinality = cardinality;
+exports.canonicalSet = canonicalSet;
+exports.singleton = singleton;
+exports.pair = pair;
+exports.union = union;
+exports.unionFamily = unionFamily;
+exports.intersection = intersection;
+exports.difference = difference;
+exports.powerSet = powerSet;
+exports.orderedPair = orderedPair;
+exports.fst = fst;
+exports.snd = snd;
+exports.cartesianProduct = cartesianProduct;
+exports.succ = succ;
+exports.nat = nat;
+exports.isTransitive = isTransitive;
+exports.isOrdinal = isOrdinal;
+const makeSet = (elements) => ({
+    kind: 'set',
+    elements
+});
+exports.EMPTY = makeSet([]);
+/**
+ * Canonical identifier for an HF set. Two HF sets are extensionally equal
+ * iff their canonicalize() outputs are identical strings.
+ *
+ * Implementation: every distinct extensional set is mapped to a compact
+ * integer ID via Hopcroft-style interning. The returned string is the
+ * literal `'#<id>'`. This avoids the exponential blowup that the naive
+ * recursive "{e1,e2,...}" serialization would have on deeply nested
+ * sets like von Neumann ordinals nat(n) (whose canonical string grows
+ * as Θ(2^n)). The interning table is a module-level singleton; since
+ * HFSet is structurally immutable in practice this is safe.
+ */
+const internByKey = new Map();
+const idByObject = new WeakMap();
+function canonicalize(x) {
+    const cached = idByObject.get(x);
+    if (cached !== undefined) {
+        return cached;
+    }
+    let key;
+    if (x.elements.length === 0) {
+        key = '0';
+    }
+    else {
+        const childIds = x.elements.map(canonicalize);
+        const unique = Array.from(new Set(childIds));
+        unique.sort();
+        key = unique.join(',');
+    }
+    let id = internByKey.get(key);
+    if (id === undefined) {
+        id = `#${internByKey.size.toString(36)}`;
+        internByKey.set(key, id);
+    }
+    idByObject.set(x, id);
+    return id;
+}
+function setEquals(a, b) {
+    return canonicalize(a) === canonicalize(b);
+}
+function isElement(x, A) {
+    const target = canonicalize(x);
+    for (const e of A.elements) {
+        if (canonicalize(e) === target) {
+            return true;
+        }
+    }
+    return false;
+}
+function isSubset(a, b) {
+    for (const e of a.elements) {
+        if (!isElement(e, b)) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * Cardinality is the number of *distinct* elements (after canonical dedup).
+ * `a.elements` may contain syntactic duplicates if the set was built by
+ * hand; we count once per equivalence class.
+ */
+function cardinality(a) {
+    const seen = new Set();
+    for (const e of a.elements) {
+        seen.add(canonicalize(e));
+    }
+    return seen.size;
+}
+/**
+ * Returns the canonical representative of a set: same elements, deduplicated
+ * and ordered. Useful when consumers want a stable shape.
+ */
+function canonicalSet(a) {
+    const seen = new Map();
+    for (const e of a.elements) {
+        const key = canonicalize(e);
+        if (!seen.has(key)) {
+            seen.set(key, canonicalSet(e));
+        }
+    }
+    const sortedKeys = Array.from(seen.keys()).sort();
+    const ordered = [];
+    for (const k of sortedKeys) {
+        const value = seen.get(k);
+        if (value !== undefined) {
+            ordered.push(value);
+        }
+    }
+    return makeSet(ordered);
+}
+function singleton(x) {
+    return makeSet([x]);
+}
+function pair(a, b) {
+    if (setEquals(a, b)) {
+        return makeSet([a]);
+    }
+    return makeSet([a, b]);
+}
+function union(a, b) {
+    const seen = new Map();
+    for (const e of a.elements) {
+        seen.set(canonicalize(e), e);
+    }
+    for (const e of b.elements) {
+        const key = canonicalize(e);
+        if (!seen.has(key)) {
+            seen.set(key, e);
+        }
+    }
+    return makeSet(Array.from(seen.values()));
+}
+/**
+ * Generalized union: union of every element of `sets`. If `sets` is the
+ * family {A1, A2, ...} returns A1 ∪ A2 ∪ ... (Axiom of Union).
+ */
+function unionFamily(sets) {
+    const family = Array.isArray(sets) ? sets : sets.elements;
+    let acc = exports.EMPTY;
+    for (const s of family) {
+        acc = union(acc, s);
+    }
+    return acc;
+}
+function intersection(a, b) {
+    const out = [];
+    const seen = new Set();
+    for (const e of a.elements) {
+        const key = canonicalize(e);
+        if (!seen.has(key) && isElement(e, b)) {
+            seen.add(key);
+            out.push(e);
+        }
+    }
+    return makeSet(out);
+}
+function difference(a, b) {
+    const out = [];
+    const seen = new Set();
+    for (const e of a.elements) {
+        const key = canonicalize(e);
+        if (!seen.has(key) && !isElement(e, b)) {
+            seen.add(key);
+            out.push(e);
+        }
+    }
+    return makeSet(out);
+}
+/**
+ * Power set: set of all subsets. For a set of cardinality n returns a set
+ * of cardinality 2^n. Implementation is the classic bitmask enumeration
+ * over the canonical element list.
+ */
+function powerSet(a) {
+    const canonical = canonicalSet(a);
+    const xs = canonical.elements;
+    const n = xs.length;
+    const total = 1 << n;
+    const subsets = [];
+    for (let mask = 0; mask < total; mask++) {
+        const sub = [];
+        for (let i = 0; i < n; i++) {
+            if ((mask & (1 << i)) !== 0) {
+                const element = xs[i];
+                if (element !== undefined) {
+                    sub.push(element);
+                }
+            }
+        }
+        subsets.push(makeSet(sub));
+    }
+    return makeSet(subsets);
+}
+/**
+ * Kuratowski ordered pair: ⟨a, b⟩ := { {a}, {a, b} }.
+ * Recovers `fst` and `snd` correctly even when a = b.
+ */
+function orderedPair(a, b) {
+    const left = singleton(a);
+    const right = pair(a, b);
+    return pair(left, right);
+}
+/**
+ * Extracts the first component of a Kuratowski pair. Returns null if the
+ * input is not shaped like an ordered pair.
+ */
+function fst(p) {
+    if (p.elements.length === 0 || p.elements.length > 2) {
+        return null;
+    }
+    const first = p.elements[0];
+    if (first === undefined || first.elements.length === 0) {
+        return null;
+    }
+    // The singleton {a} sits inside p; its sole element is a.
+    for (const member of p.elements) {
+        if (member.elements.length === 1) {
+            const candidate = member.elements[0];
+            if (candidate !== undefined) {
+                return candidate;
+            }
+        }
+    }
+    return null;
+}
+function snd(p) {
+    if (p.elements.length === 0 || p.elements.length > 2) {
+        return null;
+    }
+    const a = fst(p);
+    if (a === null) {
+        return null;
+    }
+    // Look for the {a, b} side. If p = {{a}}, then b = a.
+    for (const member of p.elements) {
+        if (member.elements.length === 2) {
+            const m0 = member.elements[0];
+            const m1 = member.elements[1];
+            if (m0 === undefined || m1 === undefined) {
+                continue;
+            }
+            if (setEquals(m0, a)) {
+                return m1;
+            }
+            if (setEquals(m1, a)) {
+                return m0;
+            }
+        }
+    }
+    // Degenerate pair ⟨a, a⟩ = {{a}}.
+    return a;
+}
+/**
+ * Cartesian product A × B = { ⟨a, b⟩ : a ∈ A, b ∈ B }.
+ */
+function cartesianProduct(a, b) {
+    const ca = canonicalSet(a);
+    const cb = canonicalSet(b);
+    const out = [];
+    const seen = new Set();
+    for (const x of ca.elements) {
+        for (const y of cb.elements) {
+            const pp = orderedPair(x, y);
+            const key = canonicalize(pp);
+            if (!seen.has(key)) {
+                seen.add(key);
+                out.push(pp);
+            }
+        }
+    }
+    return makeSet(out);
+}
+/**
+ * Von Neumann natural number: 0 := ∅, succ(n) := n ∪ {n}.
+ * Therefore n = {0, 1, ..., n-1}.
+ */
+function succ(n) {
+    return union(n, singleton(n));
+}
+function nat(n) {
+    if (!Number.isInteger(n) || n < 0) {
+        throw new RangeError('nat(n): n debe ser entero no negativo');
+    }
+    let acc = exports.EMPTY;
+    for (let i = 0; i < n; i++) {
+        acc = succ(acc);
+    }
+    return acc;
+}
+/**
+ * Transitive: every element of x is also a subset of x.
+ * Required by the von Neumann ordinal definition.
+ */
+function isTransitive(x) {
+    for (const e of x.elements) {
+        if (!isSubset(e, x)) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * Von Neumann ordinal: transitive set, well-ordered by ∈. On HF sets
+ * (where every membership chain terminates by Foundation) this collapses
+ * to: x is transitive and every element of x is also transitive.
+ */
+function isOrdinal(x) {
+    if (!isTransitive(x)) {
+        return false;
+    }
+    for (const e of x.elements) {
+        if (!isTransitive(e)) {
+            return false;
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=hf-sets.js.map

package/dist/reasoning/set-theory/hf-sets.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hf-sets.js","sourceRoot":"","sources":["../../../src/reasoning/set-theory/hf-sets.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AA6BH,oCAqBC;AAED,8BAEC;AAED,8BAQC;AAED,4BAOC;AAOD,kCAMC;AAMD,oCAiBC;AAED,8BAEC;AAED,oBAKC;AAED,sBAYC;AAMD,kCAOC;AAED,oCAWC;AAED,gCAWC;AAOD,4BAmBC;AAMD,kCAIC;AAMD,kBAkBC;AAED,kBA0BC;AAKD,4CAgBC;AAMD,oBAEC;AAED,kBASC;AAMD,oCAOC;AAOD,8BAUC;AApUD,MAAM,OAAO,GAAG,CAAC,QAA8B,EAAS,EAAE,CAAC,CAAC;IAC1D,IAAI,EAAE,KAAK;IACX,QAAQ;CACT,CAAC,CAAC;AAEU,QAAA,KAAK,GAAU,OAAO,CAAC,EAAE,CAAC,CAAC;AAExC;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;AAC9C,MAAM,UAAU,GAAG,IAAI,OAAO,EAAiB,CAAC;AAEhD,SAAgB,YAAY,CAAC,CAAQ;IACnC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,IAAI,GAAW,CAAC;IAChB,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,GAAG,GAAG,GAAG,CAAC;IACZ,CAAC;SAAM,CAAC;QACN,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC9C,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,IAAI,EAAE,CAAC;QACd,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IACD,IAAI,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;QACrB,EAAE,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;QACzC,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAC3B,CAAC;IACD,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACtB,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAgB,SAAS,CAAC,CAAQ,EAAE,CAAQ;IAC1C,OAAO,YAAY,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED,SAAgB,SAAS,CAAC,CAAQ,EAAE,CAAQ;IAC1C,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAgB,QAAQ,CAAC,CAAQ,EAAE,CAAQ;IACzC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACrB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAgB,WAAW,CAAC,CAAQ;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAAC,CAAQ;IACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAiB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAClD,MAAM,OAAO,GAAY,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC;AAC1B,CAAC;AAED,SAAgB,SAAS,CAAC,CAAQ;IAChC,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtB,CAAC;AAED,SAAgB,IAAI,CAAC,CAAQ,EAAE,CAAQ;IACrC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACpB,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED,SAAgB,KAAK,CAAC,CAAQ,EAAE,CAAQ;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAiB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,SAAgB,WAAW,CAAC,IAAqB;IAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;IAC1D,IAAI,GAAG,GAAU,aAAK,CAAC;IACvB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAgB,YAAY,CAAC,CAAQ,EAAE,CAAQ;IAC7C,MAAM,GAAG,GAAY,EAAE,CAAC;IACxB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AACtB,CAAC;AAED,SAAgB,UAAU,CAAC,CAAQ,EAAE,CAAQ;IAC3C,MAAM,GAAG,GAAY,EAAE,CAAC;IACxB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AACtB,CAAC;AAED;;;;GAIG;AACH,SAAgB,QAAQ,CAAC,CAAQ;IAC/B,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,SAAS,CAAC,QAAQ,CAAC;IAC9B,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC;IACpB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,MAAM,OAAO,GAAY,EAAE,CAAC;IAC5B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;QACxC,MAAM,GAAG,GAAY,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,MAAM,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;oBAC1B,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,SAAgB,WAAW,CAAC,CAAQ,EAAE,CAAQ;IAC5C,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzB,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED;;;GAGG;AACH,SAAgB,GAAG,CAAC,CAAQ;IAC1B,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,0DAA0D;IAC1D,KAAK,MAAM,MAAM,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,OAAO,SAAS,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAgB,GAAG,CAAC,CAAQ;IAC1B,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sDAAsD;IACtD,KAAK,MAAM,MAAM,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,MAAM,EAAE,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,EAAE,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACzC,SAAS;YACX,CAAC;YACD,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;gBACrB,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;gBACrB,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;IACH,CAAC;IACD,kCAAkC;IAClC,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;GAEG;AACH,SAAgB,gBAAgB,CAAC,CAAQ,EAAE,CAAQ;IACjD,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAY,EAAE,CAAC;IACxB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;YAC5B,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7B,MAAM,GAAG,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AACtB,CAAC;AAED;;;GAGG;AACH,SAAgB,IAAI,CAAC,CAAQ;IAC3B,OAAO,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAChC,CAAC;AAED,SAAgB,GAAG,CAAC,CAAS;IAC3B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,uCAAuC,CAAC,CAAC;IAChE,CAAC;IACD,IAAI,GAAG,GAAU,aAAK,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAAC,CAAQ;IACnC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACpB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAgB,SAAS,CAAC,CAAQ;IAChC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;YACrB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/reasoning/set-theory/index.d.ts

@@ -0,0 +1,7 @@
+export { EMPTY, canonicalize, canonicalSet, cardinality, cartesianProduct, difference, fst, intersection, isElement, isOrdinal, isSubset, isTransitive, nat, orderedPair, pair, powerSet, setEquals, singleton, snd, succ, union, unionFamily } from './hf-sets';
+export type { HFSet } from './hf-sets';
+export { EMPTY_FUNCTION, applyHF, composeHF, isBijective, isInjective, isSurjective, isValidFunction, makeFunction } from './hf-functions';
+export type { HFFunction } from './hf-functions';
+export { checkAllAxioms, checkExtensionality, checkFoundation, checkInfinity, checkPairing, checkPowerSet, checkUnion } from './zfc-axioms';
+export type { ZFCAxiomCheck } from './zfc-axioms';
+//# sourceMappingURL=index.d.ts.map

package/dist/reasoning/set-theory/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reasoning/set-theory/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,EACL,YAAY,EACZ,YAAY,EACZ,WAAW,EACX,gBAAgB,EAChB,UAAU,EACV,GAAG,EACH,YAAY,EACZ,SAAS,EACT,SAAS,EACT,QAAQ,EACR,YAAY,EACZ,GAAG,EACH,WAAW,EACX,IAAI,EACJ,QAAQ,EACR,SAAS,EACT,SAAS,EACT,GAAG,EACH,IAAI,EACJ,KAAK,EACL,WAAW,EACZ,MAAM,WAAW,CAAC;AACnB,YAAY,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAEvC,OAAO,EACL,cAAc,EACd,OAAO,EACP,SAAS,EACT,WAAW,EACX,WAAW,EACX,YAAY,EACZ,eAAe,EACf,YAAY,EACb,MAAM,gBAAgB,CAAC;AACxB,YAAY,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAEjD,OAAO,EACL,cAAc,EACd,mBAAmB,EACnB,eAAe,EACf,aAAa,EACb,YAAY,EACZ,aAAa,EACb,UAAU,EACX,MAAM,cAAc,CAAC;AACtB,YAAY,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC"}

package/dist/reasoning/set-theory/index.js

@@ -0,0 +1,44 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.checkUnion = exports.checkPowerSet = exports.checkPairing = exports.checkInfinity = exports.checkFoundation = exports.checkExtensionality = exports.checkAllAxioms = exports.makeFunction = exports.isValidFunction = exports.isSurjective = exports.isInjective = exports.isBijective = exports.composeHF = exports.applyHF = exports.EMPTY_FUNCTION = exports.unionFamily = exports.union = exports.succ = exports.snd = exports.singleton = exports.setEquals = exports.powerSet = exports.pair = exports.orderedPair = exports.nat = exports.isTransitive = exports.isSubset = exports.isOrdinal = exports.isElement = exports.intersection = exports.fst = exports.difference = exports.cartesianProduct = exports.cardinality = exports.canonicalSet = exports.canonicalize = exports.EMPTY = void 0;
+var hf_sets_1 = require("./hf-sets");
+Object.defineProperty(exports, "EMPTY", { enumerable: true, get: function () { return hf_sets_1.EMPTY; } });
+Object.defineProperty(exports, "canonicalize", { enumerable: true, get: function () { return hf_sets_1.canonicalize; } });
+Object.defineProperty(exports, "canonicalSet", { enumerable: true, get: function () { return hf_sets_1.canonicalSet; } });
+Object.defineProperty(exports, "cardinality", { enumerable: true, get: function () { return hf_sets_1.cardinality; } });
+Object.defineProperty(exports, "cartesianProduct", { enumerable: true, get: function () { return hf_sets_1.cartesianProduct; } });
+Object.defineProperty(exports, "difference", { enumerable: true, get: function () { return hf_sets_1.difference; } });
+Object.defineProperty(exports, "fst", { enumerable: true, get: function () { return hf_sets_1.fst; } });
+Object.defineProperty(exports, "intersection", { enumerable: true, get: function () { return hf_sets_1.intersection; } });
+Object.defineProperty(exports, "isElement", { enumerable: true, get: function () { return hf_sets_1.isElement; } });
+Object.defineProperty(exports, "isOrdinal", { enumerable: true, get: function () { return hf_sets_1.isOrdinal; } });
+Object.defineProperty(exports, "isSubset", { enumerable: true, get: function () { return hf_sets_1.isSubset; } });
+Object.defineProperty(exports, "isTransitive", { enumerable: true, get: function () { return hf_sets_1.isTransitive; } });
+Object.defineProperty(exports, "nat", { enumerable: true, get: function () { return hf_sets_1.nat; } });
+Object.defineProperty(exports, "orderedPair", { enumerable: true, get: function () { return hf_sets_1.orderedPair; } });
+Object.defineProperty(exports, "pair", { enumerable: true, get: function () { return hf_sets_1.pair; } });
+Object.defineProperty(exports, "powerSet", { enumerable: true, get: function () { return hf_sets_1.powerSet; } });
+Object.defineProperty(exports, "setEquals", { enumerable: true, get: function () { return hf_sets_1.setEquals; } });
+Object.defineProperty(exports, "singleton", { enumerable: true, get: function () { return hf_sets_1.singleton; } });
+Object.defineProperty(exports, "snd", { enumerable: true, get: function () { return hf_sets_1.snd; } });
+Object.defineProperty(exports, "succ", { enumerable: true, get: function () { return hf_sets_1.succ; } });
+Object.defineProperty(exports, "union", { enumerable: true, get: function () { return hf_sets_1.union; } });
+Object.defineProperty(exports, "unionFamily", { enumerable: true, get: function () { return hf_sets_1.unionFamily; } });
+var hf_functions_1 = require("./hf-functions");
+Object.defineProperty(exports, "EMPTY_FUNCTION", { enumerable: true, get: function () { return hf_functions_1.EMPTY_FUNCTION; } });
+Object.defineProperty(exports, "applyHF", { enumerable: true, get: function () { return hf_functions_1.applyHF; } });
+Object.defineProperty(exports, "composeHF", { enumerable: true, get: function () { return hf_functions_1.composeHF; } });
+Object.defineProperty(exports, "isBijective", { enumerable: true, get: function () { return hf_functions_1.isBijective; } });
+Object.defineProperty(exports, "isInjective", { enumerable: true, get: function () { return hf_functions_1.isInjective; } });
+Object.defineProperty(exports, "isSurjective", { enumerable: true, get: function () { return hf_functions_1.isSurjective; } });
+Object.defineProperty(exports, "isValidFunction", { enumerable: true, get: function () { return hf_functions_1.isValidFunction; } });
+Object.defineProperty(exports, "makeFunction", { enumerable: true, get: function () { return hf_functions_1.makeFunction; } });
+var zfc_axioms_1 = require("./zfc-axioms");
+Object.defineProperty(exports, "checkAllAxioms", { enumerable: true, get: function () { return zfc_axioms_1.checkAllAxioms; } });
+Object.defineProperty(exports, "checkExtensionality", { enumerable: true, get: function () { return zfc_axioms_1.checkExtensionality; } });
+Object.defineProperty(exports, "checkFoundation", { enumerable: true, get: function () { return zfc_axioms_1.checkFoundation; } });
+Object.defineProperty(exports, "checkInfinity", { enumerable: true, get: function () { return zfc_axioms_1.checkInfinity; } });
+Object.defineProperty(exports, "checkPairing", { enumerable: true, get: function () { return zfc_axioms_1.checkPairing; } });
+Object.defineProperty(exports, "checkPowerSet", { enumerable: true, get: function () { return zfc_axioms_1.checkPowerSet; } });
+Object.defineProperty(exports, "checkUnion", { enumerable: true, get: function () { return zfc_axioms_1.checkUnion; } });
+//# sourceMappingURL=index.js.map

package/dist/reasoning/set-theory/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/reasoning/set-theory/index.ts"],"names":[],"mappings":";;;AAAA,qCAuBmB;AAtBjB,gGAAA,KAAK,OAAA;AACL,uGAAA,YAAY,OAAA;AACZ,uGAAA,YAAY,OAAA;AACZ,sGAAA,WAAW,OAAA;AACX,2GAAA,gBAAgB,OAAA;AAChB,qGAAA,UAAU,OAAA;AACV,8FAAA,GAAG,OAAA;AACH,uGAAA,YAAY,OAAA;AACZ,oGAAA,SAAS,OAAA;AACT,oGAAA,SAAS,OAAA;AACT,mGAAA,QAAQ,OAAA;AACR,uGAAA,YAAY,OAAA;AACZ,8FAAA,GAAG,OAAA;AACH,sGAAA,WAAW,OAAA;AACX,+FAAA,IAAI,OAAA;AACJ,mGAAA,QAAQ,OAAA;AACR,oGAAA,SAAS,OAAA;AACT,oGAAA,SAAS,OAAA;AACT,8FAAA,GAAG,OAAA;AACH,+FAAA,IAAI,OAAA;AACJ,gGAAA,KAAK,OAAA;AACL,sGAAA,WAAW,OAAA;AAIb,+CASwB;AARtB,8GAAA,cAAc,OAAA;AACd,uGAAA,OAAO,OAAA;AACP,yGAAA,SAAS,OAAA;AACT,2GAAA,WAAW,OAAA;AACX,2GAAA,WAAW,OAAA;AACX,4GAAA,YAAY,OAAA;AACZ,+GAAA,eAAe,OAAA;AACf,4GAAA,YAAY,OAAA;AAId,2CAQsB;AAPpB,4GAAA,cAAc,OAAA;AACd,iHAAA,mBAAmB,OAAA;AACnB,6GAAA,eAAe,OAAA;AACf,2GAAA,aAAa,OAAA;AACb,0GAAA,YAAY,OAAA;AACZ,2GAAA,aAAa,OAAA;AACb,wGAAA,UAAU,OAAA"}

package/dist/reasoning/set-theory/zfc-axioms.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Sanity checks of selected ZFC axioms restricted to the Vω fragment.
+ *
+ * Most axioms hold on Vω: extensionality, pairing, union, power set,
+ * foundation, separation, replacement. Infinity FAILS on Vω because Vω
+ * is exactly the universe of hereditarily finite sets — there is no
+ * infinite set inside it.
+ *
+ * The "check" functions verify on a sample of HF sets. They return
+ * `holds = false` plus a counterexample when violated.
+ */
+import { HFSet } from './hf-sets';
+export interface ZFCAxiomCheck {
+    readonly name: string;
+    readonly holds: boolean;
+    readonly note?: string;
+    readonly counterexample?: ReadonlyArray<HFSet>;
+}
+/**
+ * Axiom of Extensionality: ∀A ∀B (A = B ↔ ∀x (x ∈ A ↔ x ∈ B)).
+ * Our canonicalization implements extensionality directly, so we verify
+ * agreement on a sample plus the contrapositive on intentionally distinct
+ * sets.
+ */
+export declare function checkExtensionality(): ZFCAxiomCheck;
+/**
+ * Axiom of Pairing: ∀a ∀b ∃P (a ∈ P ∧ b ∈ P ∧ ∀x (x ∈ P → x = a ∨ x = b)).
+ */
+export declare function checkPairing(_samples?: number): ZFCAxiomCheck;
+/**
+ * Axiom of Union: for any family F there exists ⋃F such that x ∈ ⋃F iff
+ * x ∈ A for some A ∈ F.
+ */
+export declare function checkUnion(_samples?: number): ZFCAxiomCheck;
+/**
+ * Axiom of Power Set: ∀A ∃P (∀x (x ∈ P ↔ x ⊆ A)). Sample over small sets
+ * to keep |P(A)| = 2^|A| manageable.
+ */
+export declare function checkPowerSet(_samples?: number): ZFCAxiomCheck;
+/**
+ * Axiom of Infinity: ∃I (∅ ∈ I ∧ ∀x (x ∈ I → succ(x) ∈ I)). This is
+ * exactly what fails on Vω: there is no HF set closed under successor,
+ * because successor strictly increases rank and HF sets have finite rank.
+ *
+ * We "witness" the failure by attempting a closure construction: start
+ * with ∅, repeatedly add successors, and observe that the inductive set
+ * cannot terminate inside Vω. Programmatically we cap the search depth
+ * and report holds=false with the partial witness.
+ */
+export declare function checkInfinity(): ZFCAxiomCheck;
+/**
+ * Axiom of Foundation (Regularity): every nonempty set A has an element
+ * disjoint from A. On HF sets this holds automatically because the
+ * membership relation is well-founded by construction (no cycles, no
+ * infinite descending chains).
+ */
+export declare function checkFoundation(_samples?: number): ZFCAxiomCheck;
+export declare function checkAllAxioms(): ZFCAxiomCheck[];
+//# sourceMappingURL=zfc-axioms.d.ts.map

package/dist/reasoning/set-theory/zfc-axioms.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"zfc-axioms.d.ts","sourceRoot":"","sources":["../../../src/reasoning/set-theory/zfc-axioms.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAIL,KAAK,EAWN,MAAM,WAAW,CAAC;AAEnB,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,cAAc,CAAC,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC;CAChD;AAkCD;;;;;GAKG;AACH,wBAAgB,mBAAmB,IAAI,aAAa,CAyBnD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,QAAQ,SAAI,GAAG,aAAa,CAexD;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,QAAQ,SAAI,GAAG,aAAa,CAiCtD;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,QAAQ,SAAI,GAAG,aAAa,CAsBzD;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,IAAI,aAAa,CA2B7C;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,QAAQ,SAAI,GAAG,aAAa,CAsB3D;AAED,wBAAgB,cAAc,IAAI,aAAa,EAAE,CAShD"}