Lax Lean Archive

The Cook–Levin theorem

Lax429075.CookLevin · concepts/Lax429075/CookLevin.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

    Theorem

    Satisfiability of CNF formulas is NP-complete under polynomial many-one reductions.

    Concept map
    8 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 3 of this submission's paper

    Lean source view on GitHub

    1import Lax429075.Satisfiability
    2import Lax429075.Reductions
    3
    4/-!
    5---
    6title: The Cook–Levin theorem
    7type: theorem
    8---
    9Satisfiability of CNF formulas is NP-complete under polynomial many-one reductions.
    10-/
    11
    12namespace Lax429075.CookLevin
    13
    14open Satisfiability Reductions
    15
    16axiom np_complete : NPComplete SAT
    17
    18end Lax429075.CookLevin
    19
    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…