linear logic

Billets

  • A Linear Logic Prover

    , par Naoyuki Tamura

    This small program searches a cut-free proof of the given two-sided sequent of first-order linear logic. Of course, the proof search of linear logic is undecidable. Therefore, this program limits the number of contraction rules for each path of the proof at most three (this threshold value can (...)