https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/Head https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/assertion https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/provenance https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/pubinfo https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test http://purl.org/dc/terms/description analysis.py enumerates all binary-tree term shapes with up to 4 operator occurrences split between the two sides, labels variables canonically (restricted-growth strings over the leaves of lhs then rhs), drops lhs == rhs and side-swapped duplicates (4692 systems), and for k = 2 and 3 evaluates every one of the 16 and 19,683 operator tables on every variable assignment with numpy, keeping the models and counting isomorphism classes via the canonical (minimal) table number over all permutations of the k elements. Validation family (lhs == a, up to 6 operators, k = 2 only) and the supplementary runs S1 (Wolfram's lhs == a family over {a, b} with up to 3 operators, k = 2, 3 exact plus a capped 4-element search) and S2 (capped 4-element search for the 2792 main-family systems not already 'many forms' at k = 3; --k4 flag, about 25 minutes) are described in interpretation and caveats. Default run about 2 minutes; derived/axioms.csv.gz (gzip, without the k2 model-set column) and derived/supplementary.json are from the --k4 run. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/Assessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 0.4049 fraction of axiom systems with >= 3 non-isomorphic 3-element models ('many forms') (n = 4692, exhaustive enumeration, no sampling; 1900 of 4692 systems). Interpretation: Wolfram's pictures (pp. 804-805) show, for a sequence of simple axiom systems, the operator forms (multiplication tables) allowed with 2, 3 and 4 elements, inequivalent under relabelling; his claim is that the vast majority of systems allow many forms and are 'not really about operators of any particular form', while a few (logic, i.e. Nand; junctional, equivalential and implicational calculi) force essentially a single form. This test reproduces that model enumeration for k = 2 and 3 only (k = 4 would require 4^16 tables per axiom, beyond the budget) over an explicit, exhaustively enumerated family of the simplest single-equation systems. 'Vast majority' is read as >= 80%, 'only a few' as <= 5%. Multi-axiom systems (e.g. group theory) are outside the enumerated family and are not needed for the majority statement. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch12-41: refutes, confidence 0.45 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test http://www.w3.org/2000/01/rdf-schema#seeAlso https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch12-41/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/admissibleDatasets Planned datasets: single-equation-axiom-systems-n-le-4 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation Pre-registered. The claim FAILS if fewer than 50% of the axiom systems have 'many forms', or if more than 20% force a 'single form'. Between those bounds and the pass thresholds the verdict is 'mixed'. If the enumeration cannot be completed for k = 3 within the run-time budget the verdict is inconclusive (underpowered). https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/evidenceAgainst 32.5% of the systems (1525) have no 2- or 3-element model at all (e.g. a o b == c, a o (b o c) == b o (a o c) == ... forcing a one-element structure); whether such degenerate equations belong to the population Wolfram had in mind is unclear. Excluding them, and adding a capped 4-element search (supplementary S2: 306 further systems gain >= 3 forms at k = 4; 1703 searches hit the node budget, so this is a lower bound), the many-forms fraction is 52.0% and the single-form fraction 6.4%, i.e. the mixed band rather than failure. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/evidenceAgainst In Wolfram's own illustrated family (lhs == a with lhs over {a, b}, up to 3 operators; supplementary S1, 101 systems), 67 (66%) allow >= 3 forms for some k <= 4, 4 force a single form and 4 have no non-trivial form, which is closer to his description but still short of 'vast majority' at the 80% reading. The pre-registered validation against the note on p. 1171 was uninformative: under this canonical labelling no lhs == a system with <= 6 operators has k = 2 models exactly {Xor, Xnor} or {Nand, Nor}, because the note's family evidently uses a different variable convention (its counts 32,004 and 964 could not be reproduced). https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Only models with 2 and 3 elements (and a capped 4-element search) were examined; the pictures in the book go to 4 elements exactly. Isomorphism is relabelling of elements only (duality/anti-isomorphism not identified). Thresholds (80% / 50%, 5% / 20%) are readings of 'vast majority' and 'only a few'. Six systems have exactly {Nand, Nor} as 2-element models, e.g. ((a o b) o (b o (a o a))) == b, consistent with the book's statement that short axioms for Nand exist, and 40 have exactly {Xor, Xnor}. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Pre-registered decision: 40.5% of the 4692 simplest single-equation axiom systems have 'many forms' (>= 3 non-isomorphic 3-element models), below the pre-registered 50% failure bound, so the 'vast majority' reading fails in this family; the 'single form' fraction (14.5%) falls in the mixed band (5-20%). The verdict follows the pre-registration, but the confidence is low because the result is sensitive to definitional choices listed below. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/expectedObservation Pre-registered. Family: all single-equation axiom systems lhs == rhs where lhs and rhs are terms built from one binary operator and variables, with a total of n = 1..4 operator occurrences in the equation, variables named canonically in order of first occurrence (a, b, c, ...) reading lhs then rhs, excluding equations with lhs identical to rhs, and identifying an equation with its side-swapped twin (so each unordered pair of sides is counted once). For each axiom system and each k in {2, 3}, enumerate all k^(k^2) operator tables (16 and 19,683), keep those satisfying the equation for every assignment of the variables, and count the models up to isomorphism (relabelling of the k elements by any permutation): m2 and m3. Definitions: 'many forms' = m3 >= 3; 'single form' = m2 <= 1 and m3 <= 1 and m2 + m3 >= 1; 'no non-trivial form' = m2 = m3 = 0 (only the one-element model). The claim PASSES if the fraction of axiom systems with 'many forms' is >= 0.80 and the fraction with 'single form' is <= 0.05. Reported, not decisive: the same fractions restricted to n = 4; the list of 'single form' systems; the systems whose k = 2 model set is exactly {Nand, Nor} (operators 7 and 1 in Wolfram's numbering) or {Xor, Xnor} (6 and 9); and, as a validation of the model-finding code against the note 'Properties of operators from axioms' (p. 1171), the k = 2 model sets of all lhs == a systems with up to 6 operators under this canonical labelling, listing how many allow only {6, 9} and only {1, 7} (the note reports 32,004 and 964 for its family of 274,499 systems; the family definition in the note is not fully specified, so this is a plausibility check, not a decisive comparison). https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. The claim FAILS if fewer than 50% of the axiom systems have 'many forms', or if more than 20% force a 'single form'. Between those bounds and the pass thresholds the verdict is 'mixed'. If the enumeration cannot be completed for k = 3 within the run-time budget the verdict is inconclusive (underpowered). https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.45 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-41--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/hasVerdict refutes https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/hypothesis Among the simplest equational axiom systems for one binary operator (single equations with at most four operator occurrences), the large majority admit several non-isomorphic finite models (operator forms) on 2 and 3 elements, and only a small minority force a single form. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/inferenceMethod analysis.py enumerates all binary-tree term shapes with up to 4 operator occurrences split between the two sides, labels variables canonically (restricted-growth strings over the leaves of lhs then rhs), drops lhs == rhs and side-swapped duplicates (4692 systems), and for k = 2 and 3 evaluates every one of the 16 and 19,683 operator tables on every variable assignment with numpy, keeping the models and counting isomorphism classes via the canonical (minimal) table number over all permutations of the k elements. Validation family (lhs == a, up to 6 operators, k = 2 only) and the supplementary runs S1 (Wolfram's lhs == a family over {a, b} with up to 3 operators, k = 2, 3 exact plus a capped 4-element search) and S2 (capped 4-element search for the 2792 main-family systems not already 'many forms' at k = 3; --k4 flag, about 25 minutes) are described in interpretation and caveats. Default run about 2 minutes; derived/axioms.csv.gz (gzip, without the k2 model-set column) and derived/supplementary.json are from the --k4 run. https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered. Family: all single-equation axiom systems lhs == rhs where lhs and rhs are terms built from one binary operator and variables, with a total of n = 1..4 operator occurrences in the equation, variables named canonically in order of first occurrence (a, b, c, ...) reading lhs then rhs, excluding equations with lhs identical to rhs, and identifying an equation with its side-swapped twin (so each unordered pair of sides is counted once). For each axiom system and each k in {2, 3}, enumerate all k^(k^2) operator tables (16 and 19,683), keep those satisfying the equation for every assignment of the variables, and count the models up to isomorphism (relabelling of the k elements by any permutation): m2 and m3. Definitions: 'many forms' = m3 >= 3; 'single form' = m2 <= 1 and m3 <= 1 and m2 + m3 >= 1; 'no non-trivial form' = m2 = m3 = 0 (only the one-element model). The claim PASSES if the fraction of axiom systems with 'many forms' is >= 0.80 and the fraction with 'single form' is <= 0.05. Reported, not decisive: the same fractions restricted to n = 4; the list of 'single form' systems; the systems whose k = 2 model set is exactly {Nand, Nor} (operators 7 and 1 in Wolfram's numbering) or {Xor, Xnor} (6 and 9); and, as a validation of the model-finding code against the note 'Properties of operators from axioms' (p. 1171), the k = 2 model sets of all lhs == a systems with up to 6 operators under this canonical labelling, listing how many allow only {6, 9} and only {1, 7} (the note reports 32,004 and 964 for its family of 274,499 systems; the family definition in the note is not fully specified, so this is a plausibility check, not a decisive comparison). https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch12-41 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-41--claim-test--dataset-1 http://purl.org/dc/terms/description axiom family under test; finite models on 2 and 3 elements enumerated exhaustively https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-41--claim-test--dataset-1 http://purl.org/dc/terms/license generated data https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-41--claim-test--dataset-1 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-41--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: All single-equation axiom systems for one binary operator with 1-4 operator occurrences, canonical variable labelling (generated by analysis.py) https://w3id.org/delphi/resource/evidence/wolfram2002-ch12-41--claim-test--dataset-1 http://www.w3.org/ns/prov#wasDerivedFrom https://www.wolframscience.com/nks/p805--implications-for-mathematics-and-its-foundations/ https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/provenance https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#SoftwareAgent https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 http://www.w3.org/2000/01/rdf-schema#label delphisci claim tester (claude-fable-5.1; cursor/wolfram-nks-claim-tests-106e) https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 http://www.w3.org/ns/prov#actedOnBehalfOf https://orcid.org/0009-0007-4948-9192 https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/delphi/ontology/usesModel https://w3id.org/delphi/resource/model/claude-fable-5-1 https://w3id.org/delphi/resource/model/claude-fable-5-1 http://purl.org/dc/terms/identifier claude-fable-5.1 https://w3id.org/delphi/resource/model/claude-fable-5-1 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/LanguageModel https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch12-41/result.json https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/test https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/plan http://www.w3.org/ns/prov#hadPlan https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/README.md https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/plan https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-claude-fable-5-1 https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/pubinfo https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc http://purl.org/dc/terms/created 2026-11-08T16:24:31.944Z https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch12-41--claim-test https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch12-41: refutes, confidence 0.45 https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/sig http://purl.org/nanopub/x/hasSignature VY0r/J2oKyvkspFyjWWlGHZKdpKMK58cFNeWqSNf29AbnLBhGUdNIlNDC5iQNjQij/XIIBWKdipEWtlBWDA7hDedvRtxe3kgSDXTgp4Ii/h6ZNBdOMroK9uLAn3slXzhLp1mpWOEygjG9eBG+EG31tNohI2SWNzcqrJTcgx8LZyN4IvRrY21lMlGBqdO/uFJ065RBNG8NIASouSZHgwOYi/arZGj0n6JKW5COPhf+8kkQ4tWkB56gadIcc9yt8lHzwUNFyEitZeZ4FiPVyWMoLk3RckVPLvgPb9wkgFmNhlOBRJQQlrCsG9rcrPbO/JyCvpsixHZ/3VOgneCrma91g== https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc https://w3id.org/np/RAhg1drheVP7GFkK22ml9T81du1nwVLkICQHTJWKxbvMc/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192