Tier-0 Survivability and Typing

This paper presents a non-ontological Tier-0 result governing representational survivability. It proves the existence of a machine-detectable survivor class of acts defined entirely by impossibility predicates, independent of truth, correctness, or semantic grounding. Representational frames are treated as stopping points rather than compressions of reality. Within such frames, admissibility is the only well-typed predicate over acts; truth is shown to be mis-typed. The survivor class is characterised as the greatest fixed point of a monotone impossibility filter, yielding a stable, invariant object detectable without access to external semantics. This result generalises earlier domain-specific work on mathematical practice to representational systems as such, including unagentic systems. Earlier domain-specific compressions of this result, including a three mode characterisation for mathematical practice, appear in Tier-0 Portrait v 1.2. The present work factors that result to a general survivability-and-typing theorem for representational frames.