Lax Lean Archive

Draft — mutable and not usable as a dependency; its citation marks the draft state.

Lax554803.FiniteStackEquivalence

Finite stack alphabets suffice

concepts/Lax554803/FiniteStackEquivalence.lean · lax-554803

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.

    Concept map

    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Evidence

    Each proof establishes this claim relative to its assumptions.

    Theorem

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

    Lean source view on GitHub

    1import Lax554803.MachineModels
    2
    3/-!
    4---
    5title: Finite stack alphabets suffice
    6type: theorem
    7---
    8Requiring every work-stack alphabet to be finite leaves P\mathrm{P} unchanged.
    9-/
    10
    11namespace Lax554803.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 Lax554803.FiniteStackEquivalence
    19
    Show Proof

    Builds on

    Used by

    none

    From Mathlib

    none

    Community review

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.

    0 comments

    Loading discussion…