Lax Lean Archive

Finite stack alphabets suffice

Lax434930.FiniteStackEquivalence · concepts/Lax434930/FiniteStackEquivalence.lean · lax-434930

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

    Requiring every work-stack alphabet to be finite leaves P\mathrm{P} unchanged.

    Concept map
    3 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 Lax434930.MachineModels
    2
    3/-!
    4---
    5title: Finite stack alphabets suffice
    6type: lemma
    7---
    8Requiring every work-stack alphabet to be finite leaves P\mathrm{P} unchanged.
    9-/
    10
    11namespace Lax434930.FiniteStackEquivalence
    12
    13open PolynomialTime MachineModels
    14
    15/-- Requiring all work alphabets to be finite does not change P. -/
    16axiom finiteStackP_eq_P : FiniteStackP = P
    17
    18end Lax434930.FiniteStackEquivalence
    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…