ifc-0210

15.13.3 The DIAL-URL evidence sequence

This ladder moves deliberately from classification to construction.

DIAL-URL–0: exact type recovery. Exact finite operators are drawn from MDP, POMDP, SMDP, and partially observable semi-Markov families. The learner must reuse the MDP theory, adjoin only the required constructors, and quotient behaviorally redundant hidden states rather than interpreting every state alias as partial observability.
DIAL-URL–1: finite-trajectory accommodation. Operators and their uncertainty are estimated from trajectories. Admission requires calibrated false-extension control and abstention when the available horizon does not separate candidate types.
DIAL-URL–2: active discrimination. RELIC selects actions, initial conditions, and observation probes that maximally separate the currently supported behavior functors.
DIAL-URL–3: grammar synthesis. Named model classes are removed. The system constructs the smallest supported functor expression from the registered probabilistic grammar and supplies a checked syntactic transport chain from the seed expression. These finite certificates stand in for, but do not establish, natural transformations between behavior functors in an arbitrary category.
DIAL-URL–4: withheld composition law. An environment combines effects whose interaction is absent from the grammar. Success requires a new oriented comparison generator in the finite presentation, not selection from a named catalog. Naturality, coherence, and distributive-law axioms remain outside this rung.