Lax Lean Archive

Satisfiability and binary encodings

Lax429075.SATEncoding · concepts/Lax429075/SATEncoding.lean · lax-429075

proven

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Lemma

    An encoded formula belongs to the SAT language exactly when the formula is satisfiable.

    Concept map
    6 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    In the paper

    • page 1 of this submission's paper

    Lean source view on GitHub

    1import Lax429075.Satisfiability
    2
    3/-!
    4---
    5title: Satisfiability and binary encodings
    6type: lemma
    7---
    8An encoded formula belongs to the SAT language exactly when the formula is satisfiable.
    9-/
    10
    11namespace Lax429075.SATEncoding
    12
    13open CNF Encoding Satisfiability
    14
    15axiom correct (F : Formula) : encodeCNF F ∈ SAT ↔ Satisfiable F
    16
    17end Lax429075.SATEncoding
    18
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…