Skip to content

InclusionBench 0.3.1

Choose a tag to compare

@tkwa tkwa released this 20 Sep 08:40

InclusionBench 0.3.1 admits independence conditional on arithmetic soundness of ZFC, alongside unconditional and Con(ZFC)-conditional metatheorems. Arithmetic soundness means that every first-order arithmetic sentence whose standard translation ZFC proves is true in standard N. The target theory remains ZFC itself.

The Lean library now defines first-order arithmetic syntax and standard-N semantics, arithmetic soundness, the three permitted premise categories, and conditional independence certificates. It proves that arithmetic soundness implies consistency with the proof system's required logical rule explicit, and that a consistency-conditional certificate can be reused under the soundness premise without changing its target. Full ZFC encoding and correspondence remain expert-review obligations.

Task prompts and provider instructions use the new policy. Every admitted independence pair requires its own encoded sentence and both nonderivability arguments; its premise remains in evaluated provenance and leaderboard data. Independence does not produce ordinary inclusion or separation consequences.

The 50 classes, 709 known inclusions, 413 known noninclusions and 1,378 questions are unchanged. Version 0.3.0's historical audit is preserved, with an explicit policy-adoption record and a bounded primary-source review of the expanded scope.

Validation: local Python tests, Lean core and axiom audits, all 1,122 baseline inference traces, the SAT audit, generated-data/freeze checks, and a fresh offline package installation passed. The GitHub verification workflow also passed the complete quantum-library build and all seven actual isolated proof-admission tests.

The public site is tkwa.me, developed separately. This release updates the benchmark repository and its Pages mirror.

Attached wheel SHA-256: cc721b392d1e1f6a81d92589ca69f0d6ba0a857ad61ed6e85c64dd5800b9acb5.