Kaydedildi:
Detaylı Bibliyografya
Yazar: Proof Engine
Materyal Türü: Recurso digital
Dil:
Baskı/Yayın Bilgisi: Zenodo 2026
Konular:
Online Erişim:https://doi.org/10.5281/zenodo.19635621
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
İçindekiler:
  • <p>Automated fact-verification of the claim: "<em>The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\). There exists a finite binary tree consisting solely of eml operations, whose 9 leaves are drawn from \(\{1, x, y\}\), such that the tree evaluates exactly to \(x \times y\). The tree has K = 17 tokens (8 eml operations and 9 leaves), and the identity holds for all complex \(x\) and \(y\) (in the algebraic setting where \(\ln \circ \exp\) is the identity).</em>"</p> <p><strong>Verdict: PROVED</strong></p> <h3>Files</h3> <ul> <li><strong>proof.py</strong> — Re-runnable Python verification script</li> <li><strong>proof.md</strong> — Structured proof report</li> <li><strong>proof_audit.md</strong> — Full verification audit trail</li> <li><strong>proof_narrative.md</strong> — Plain-language summary</li> <li><strong>proof.json</strong> — Machine-readable structured data</li> <li><strong>provenance.json</strong> — W3C PROV-JSON provenance chain</li> <li><strong>proof.ipynb</strong> — Jupyter Notebook (interactive re-verification)</li> <li><strong>ro-crate-metadata.json</strong> — RO-Crate 1.1 research object manifest</li> </ul> <p>Generated by <a href="https://github.com/yaniv-golan/proof-engine">Proof Engine</a> v1.18.0.</p>