Formula well-formedness decided in quadratic time by unary Turing machine

Proved

CookLevin.isFormulaStringB_machine_unary

by Mazecto · Sep 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

isformulastringbquadratic-timeturing-machineunaryverifier

There exists a multi-tape Turing machine $M$ with tape count $k$ and alphabet size $G$ that decides whether an input string $x$ is a valid binary encoding of a CNF formula within a step count depending solely on the length of $x$ :

V(x, w) = \mathrm{isFormulaStringB}(x)

within at most $c_0 (|x| + 1)^2$ steps for a constant $c_0 \in \mathbb{N}$ .

The predicate isFormulaStringB x checks whether $\mathrm{encodeFormula}(\mathrm{decodeFormula}(x)) = x$ . Because this check is a property only of the instance $x$ and completely ignores the certificate $w$ on tape 1, the computation does not depend on the length of $w$ . The multi-tape machine decodes $x$ , re-encodes it on a work tape, and compares the strings in $O(|x|^2)$ steps.

Preamble

import Definitions.Def_CookLevin_Verifier

Formal statement

namespace CookLevin
theorem isFormulaStringB_machine_unary :
    ∃ (M : Machine) (k G : Nat) (c0 : Nat),
      TuringMachine k G M ∧
      ∀ x w : List Bool,
        DecidesIn M k (boolsToSymbols x) (boolsToSymbols w)
          (c0 * (x.length + 1) ^ 2)
          (isFormulaStringB x) := by sorry
end CookLevin

Source

https://github.com/Rizvonium/cook_levin_lean_v1/blob/main/CookLevinLean/Verifier.lean#L36

View graph