stack specification seq
ProvedCookPvsNP.stack_specification_seqalgorithmspolynomial-time
Semantic stack implementations compose with one source step of sequencing overhead.
Preamble
import Definitions.Def_CookPvsNP_StackSpecification open CookPvsNP
Formal statement
namespace CookPvsNP
theorem stack_specification_seq {K A S : Type} (R : S → (K → List A) → Prop)
(p q : StackProg K A) (f g : S → S) (c d : S → ℕ)
(hp : StackImplements R p f c) (hq : StackImplements R q g d) :
StackImplements R (p.seq q) (g ∘ f) (fun s => c s + 1 + d (f s)) := by sorry
end CookPvsNPSource
New auxiliary formalization for the ResourceScheduling Q2 reduction. The target is the unchanged CookPvsNP one-tape machine model, following Cook, The P versus NP problem, Clay Mathematics Institute (2000), Appendix. This explicit finite-column stack compiler and its simulation lemmas are new contributions, not numbered claims from Cook or the scheduling source paper.