Registry · Theorem IV.T211 tau-effective formalized

IV.T211 — Decidable Phase Classification Meta-Theorem

At fixed refinement stage n with bounded budget K, every regime predicate is decidable by finite recursion on NF-coded states. NF code space finite, defect components computable, no reals needed.

Book IV Part 7 Ch. 64

Dependency Graph

Depends on (1)

Depended on by (1)

Lean Formalization

Module: TauLib.BookIV.ManyBody.NFLBoundary

Symbol: Tau.BookIV.ManyBody.DecidableMeta