1. Short Definition

Admissibility is the condition under which an action, coupling, claim, contract, intervention, or execution path may proceed without violating UTS gates.

2. Canonical Definition

In UTS, admissibility determines whether a proposed transition is currently valid.

A path is not admissible merely because it is possible, efficient, popular, legal, profitable, emotionally compelling, technically executable, or locally stabilizing. It is admissible only when it preserves coherence across the relevant constraints.

Admissibility asks:

May this proceed without predictably increasing hidden debt faster than it reduces incoherence?

If the answer is no, the correct result may be:

∅

meaning null outcome: delay, refusal, containment, decoupling, repair-first sequencing, or capacity rebuilding.

3. Functional Role in UTS

Admissibility functions as the permission logic of coherence.

It applies to:

• actions
• contracts
• governance decisions
• AI decisions
• coupling events
• enforcement
• restoration claims
• reintegration pathways
• authority claims
• classification decisions
• high-impact interventions

Admissibility protects UTS from the error:

can be done ⇒ should be done

In UTS, capability does not authorize execution.

4. Canonical Test

A minimal admissibility check includes:

Au sufficient
BΣ intact
Λ > 0
R sufficient
Φ subordinate to O
Τ validation pending or satisfied

If any required gate fails, the system should not force continuation under the appearance of progress.

5. Diagnostic Signatures

Admissibility increasing

Au↑
BΣ↑
K↑
R↑
H↓
Φ subordinate to O

Admissibility failing

Au↓
BΣ↓
Λ ≤ 0
R insufficient
Φ replacing O
H↑

False admissibility

legal permission + low visible error + high Φ
without Au, BΣ, Λ, or R

This produces procedural permission without coherence validity.

6. Canonical Distinctions

Admissibility is not legality

A contract or procedure can be legal while coherence-invalid.

Admissibility is not permission

Permission is often local.

Admissibility is cross-layer.

Admissibility is not capability

A system may be able to execute an action while lacking the auditability, boundary integrity, compatibility, or restoration capacity required for valid execution.

Admissibility is not comfort

An admissible action may still be difficult, disruptive, or costly if it is necessary for repair.

7. U-Layer Mapping

8. Common Failure Patterns

9. Restoration Implications

When admissibility fails, the proper restoration question is not:

How do we force the action through?

The proper question is:

Which gate failed, and what must be restored before proceeding?

Typical restoration sequence:

Μ map failed gates
→ Au restore traceability
→ BΣ restore boundary integrity
→ Λ test compatibility
→ ℛ provision repair
→ Τ validate over time
→ Γ select renewed path

10. Machine-Readable Summary

glossary_entry:
  id: "GL-095"
  term: "Admissibility"
  short_definition: "The condition under which an action, coupling, claim, contract, intervention, or execution path may proceed without violating UTS gates."
  term_family: "Foundational System Terms"
  term_class:
    - "Core Concept"
    - "Gate Logic"
    - "Evaluation Primitive"
  key_symbol:
    - "∅"
  core_test:
    - "Au sufficient"
    - "BΣ intact"
    - "Λ > 0"
    - "R sufficient"
    - "Φ subordinate to O"
    - "Τ validation pending or satisfied"
  failure_when:
    - "Capability substitutes for permission."
    - "Legality substitutes for coherence validity."
    - "Metrics authorize action while hidden debt rises."