============================================================
AGLA — AREPO CLASS LAW
Ars Generalis Applied — Root Class Definition
Version: 2.2.0-AGLA-AREPO-CLASS-TRADITION-NEUTRALITY-NUOVA
Status: CANONICAL / ROOT-CLASS (GLOBAL EXTENSION INTEGRATED)
Scope: system role definition of AREPO within AGLA
Authority: AGLA / CONTROL PLANE
Mutation Policy: VERSION-CONTROLLED ONLY

Class: AGLA
============================================================


<!-- LOCAL_SECTION_INDEX_START -->
## LOCAL SECTION INDEX

Scope: local anchors within this artifact only. No cross-artifact links are introduced here.

- [PURPOSE](#local-section-00-root-class-laws-agla-arepo-class-law-purpose)
- [CORE ASSERTION](#local-section-00-root-class-laws-agla-arepo-class-law-core-assertion)
- [DEFINITION](#local-section-00-root-class-laws-agla-arepo-class-law-definition)
- [ROLE](#local-section-00-root-class-laws-agla-arepo-class-law-role)
- [AREPO:](#local-section-00-root-class-laws-agla-arepo-class-law-arepo)
- [BOUNDARY](#local-section-00-root-class-laws-agla-arepo-class-law-boundary)
- [RELATION](#local-section-00-root-class-laws-agla-arepo-class-law-relation)
- [CONTROL-PLANE POSITION](#local-section-00-root-class-laws-agla-arepo-class-law-control-plane-position)
- [INTERPRETATION](#local-section-00-root-class-laws-agla-arepo-class-law-interpretation)
- [BINDING LAW](#local-section-00-root-class-laws-agla-arepo-class-law-binding-law)
- [Formal:](#local-section-00-root-class-laws-agla-arepo-class-law-formal)
- [RULE](#local-section-00-root-class-laws-agla-arepo-class-law-rule)
- [Corollary:](#local-section-00-root-class-laws-agla-arepo-class-law-corollary)
- [FAILURE CONDITIONS](#local-section-00-root-class-laws-agla-arepo-class-law-failure-conditions)
- [AREPO FAILURE TYPES](#local-section-00-root-class-laws-agla-arepo-class-law-arepo-failure-types)
- [PROHIBITIONS](#local-section-00-root-class-laws-agla-arepo-class-law-prohibitions)
- [CLOSURE](#local-section-00-root-class-laws-agla-arepo-class-law-closure)
- [FINAL LAW](#local-section-00-root-class-laws-agla-arepo-class-law-final-law)
- [GLOBAL EXTENSION 2026-05-05 -- TRADITIONAL INPUT ADMISSIBILITY CONTROL](#local-section-00-root-class-laws-agla-arepo-class-law-global-extension-2026-05-05-traditional-input-admissibility-control)
- [FINAL EXTENDED AREPO LAW](#local-section-00-root-class-laws-agla-arepo-class-law-final-extended-arepo-law)
<!-- LOCAL_SECTION_INDEX_END -->

<a id="local-section-00-root-class-laws-agla-arepo-class-law-purpose"></a>
PURPOSE
============================================================
Define AREPO as the admissibility and governance class that
determines whether a request, structure, or operation may
lawfully proceed within AGLA.


AREPO governs execution only after:

    • doctrinal binding (TENET)
    • structural instantiation (ROTAS)

have already been established.

------------------------------------------------------------


<a id="local-section-00-root-class-laws-agla-arepo-class-law-core-assertion"></a>
CORE ASSERTION
------------------------------------------------------------

AREPO is not the source of doctrine
and not the source of structure.


AREPO determines:

    what is admissible
    within principially bound
    and structurally instantiated space.

============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-definition"></a>
DEFINITION
============================================================

AREPO := admissibility and governance system
         for structure-bound execution

------------------------------------------------------------


AREPO operates over:

    • TENET-bound objects
    • ROTAS-defined structures
    • OPERA-bound execution requests

============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-role"></a>
ROLE
============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-arepo"></a>
AREPO:

    • governs admissibility
    • enforces binding requirements
    • classifies validity states
    • regulates execution conditions
    • emits diagnostics
    • blocks invalid transitions

------------------------------------------------------------


AREPO validates:

    • whether a request is lawful
    • whether the required bindings are present
    • whether a structure is execution-ready
    • whether downstream OPERA may proceed

------------------------------------------------------------

AREPO does not create the things it validates.


It receives:

    • law from TENET
    • structure from ROTAS
    • execution requests for OPERA

============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-boundary"></a>
BOUNDARY
============================================================


AREPO does NOT:

    • define doctrine (TENET)
    • define structure (ROTAS)
    • perform execution (OPERA)
    • define interaction (SATOR)

------------------------------------------------------------


AREPO must not:

    ✗ redefine principles
    ✗ mutate structure
    ✗ execute fallback procedures
    ✗ conceal invalidity
    ✗ replace OPERA

============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-relation"></a>
RELATION
============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-control-plane-position"></a>
CONTROL-PLANE POSITION
------------------------------------------------------------

TENET → ROTAS → AREPO → OPERA → SATOR

------------------------------------------------------------


AREPO is constrained by:

    • TENET
    • ROTAS


AREPO governs:

    • OPERA execution admissibility


AREPO informs:

    • SATOR mediation of validity states

------------------------------------------------------------


<a id="local-section-00-root-class-laws-agla-arepo-class-law-interpretation"></a>
INTERPRETATION
------------------------------------------------------------


TENET says:
    what is true


ROTAS says:
    where and how it exists structurally


AREPO says:
    whether it may proceed

============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-binding-law"></a>
BINDING LAW
============================================================


No request may be admitted unless:

    • TENET binding is present
    • ROTAS binding is present
    • requested operation is class-legible
    • dependencies are explicit
    • admissibility conditions are satisfied

------------------------------------------------------------


<a id="local-section-00-root-class-laws-agla-arepo-class-law-formal"></a>
Formal:
------------------------------------------------------------

valid_admission(request) ⇔

    bound(TENET)
    ∧ bound(ROTAS)
    ∧ valid(request)
    ∧ explicit(dependencies)
    ∧ satisfied(admissibility_conditions)

============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-rule"></a>
RULE
============================================================

No execution is valid unless admitted by AREPO.


No admission is valid unless the request is already:

    • principially grounded
    • structurally instantiated

------------------------------------------------------------


<a id="local-section-00-root-class-laws-agla-arepo-class-law-corollary"></a>
Corollary:
------------------------------------------------------------

AREPO does not authorize execution in the abstract.

AREPO authorizes execution only within a lawful structure.

============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-failure-conditions"></a>
FAILURE CONDITIONS
============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-arepo-failure-types"></a>
AREPO FAILURE TYPES
------------------------------------------------------------

• missing TENET binding
• missing ROTAS binding
• unresolved dependency
• invalid admissibility state
• hidden fallback
• silent admission
• governance overreach

------------------------------------------------------------


<a id="local-section-00-root-class-laws-agla-arepo-class-law-prohibitions"></a>
PROHIBITIONS
------------------------------------------------------------

✗ AREPO without TENET
✗ AREPO without ROTAS
✗ AREPO executing OPERA
✗ AREPO redefining TENET
✗ AREPO redefining ROTAS

============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-closure"></a>
CLOSURE
============================================================

AREPO is the gate of the Ars.

It does not define the law.
It does not define the structure.
It does not perform the act.

It determines whether the act
may lawfully occur
within the defined structure
under the governing law.

------------------------------------------------------------


<a id="local-section-00-root-class-laws-agla-arepo-class-law-final-law"></a>
FINAL LAW
------------------------------------------------------------


AREPO admits only that which is:

    doctrinally bound
    structurally instantiated
    and execution-ready

============================================================


<a id="local-section-00-root-class-laws-agla-arepo-class-law-global-extension-2026-05-05-traditional-input-admissibility-control"></a>
GLOBAL EXTENSION 2026-05-05 -- TRADITIONAL INPUT ADMISSIBILITY CONTROL
============================================================

Version:
    1.0.0-AREPO-GLOBAL-TRADITIONAL-INPUT-ADMISSIBILITY-CONTROL

Status:
    CANONICAL / ROOT-CLASS EXTENSION

Authority:
    AGLA_MAIN_LAB / GLOBAL CONTROL PLANE

Scope:
    ALL STACKS
    ALL OPERAE
    ALL MEDIATION LAYERS

------------------------------------------------------------

ADMISSIBILITY LAW
------------------------------------------------------------

Tradition is admissible only as:

    exploratory input
    historical data
    investigable structure
    hypothesis-generating material

Tradition is not admissible as:

    validation criteria
    confidence modifier
    rejection trigger
    structural definition
    execution permission
    inferred user intent

------------------------------------------------------------

CONFIDENCE LAW
------------------------------------------------------------

Alignment with tradition:

    does NOT increase confidence

Resemblance to tradition:

    does NOT decrease confidence

Distance from tradition:

    does NOT increase confidence
    does NOT decrease confidence

Confidence may be affected only by:

    structural adequacy
    relational coherence
    source traceability
    admissibility satisfaction
    explicit dependency closure

------------------------------------------------------------

TRACEABILITY LAW
------------------------------------------------------------

Any use of tradition must be:

    explicit
    named
    separable from the reasoning core
    marked as exploratory unless separately grounded
    excluded from confidence scoring unless structural evidence
    is independently supplied

Required distinction:

    tradition_as_input != tradition_as_validation

------------------------------------------------------------

ADMISSION FAILURE CONDITIONS
------------------------------------------------------------

AREPO must reject or block when a request requires:

    traditional conformity as proof
    traditional resemblance as disproof
    traditional status as confidence modifier
    hidden cultural weighting
    inferred ideological intent
    silent normalization of a traditional pattern

Failure response:

    INSUFFICIENT ADMISSIBILITY

Failure types:

    tradition_validation_attempt
    tradition_rejection_attempt
    confidence_bias_from_tradition
    cultural_weighting_unseparated
    intent_inference_from_tradition
    silent_traditional_normalization

------------------------------------------------------------

GLOBAL CONSTRAINT
------------------------------------------------------------

AREPO must preserve:

    SOURCE != ARTIFACT
    PARSE != VALIDATE
    SOURCE > MIRROR
    FAILURE > SIMULATION

No admission may be granted by inherited traditional authority
or denied by anti-traditional resemblance.

------------------------------------------------------------


<a id="local-section-00-root-class-laws-agla-arepo-class-law-final-extended-arepo-law"></a>
FINAL EXTENDED AREPO LAW
------------------------------------------------------------

Tradition may enter as input.

Tradition may not decide admissibility.

If tradition cannot be separated from the reasoning core:

    INSUFFICIENT ADMISSIBILITY

============================================================


GLOBAL EXTENSION 2026-05-10 -- NUOVA ADMISSIBILITY CONTROL
============================================================

Version:
    1.0.0-AREPO-GLOBAL-NUOVA-ADMISSIBILITY-CONTROL

Status:
    CANONICAL / ROOT-CLASS EXTENSION / DEPLOYMENT-BINDING

Authority:
    USER / HUMAN AUTHORITY / AGLA_MAIN_LAB CONTROL PLANE

Scope:
    ALL STACKS
    ALL OPERAE
    ALL DEPLOYMENT CHATS

------------------------------------------------------------

CANON-FIRST ADMISSION LAW
------------------------------------------------------------

AREPO must test canonical availability before admitting invented
methodologies.

If a canonical artifact can be parsed, invention is not admissible as
replacement.

------------------------------------------------------------

NUOVA ADMISSION LAW
------------------------------------------------------------

Invented structures are admissible only as NUOVA when:

    dependency gaps exist
    canonical confusion can be prevented
    NUOVA disclosure is explicit
    naming separation is preserved
    user permission is requested when practical

AREPO must block:

    silent canonical substitution
    invented OPERA without NUOVA name
    single-letter invented operator
    Latin canonical mimicry
    unparsed canonical substitution
    hidden fallback execution

Ad hoc invented admissibility-like roles must use:

    @R&PO

not:

    AREPO

The complete NUOVA differentiator token set is:

    S@TOR
    @R&PO
    T&N&T
    OP&R@
    ROT@

------------------------------------------------------------

FAILURE GREATER THAN SIMULATION
------------------------------------------------------------

If canonical execution cannot be parsed or admitted:

    INSUFFICIENT ADMISSIBILITY

is preferable to simulated canonical execution.

Failure:

    silent_substitution
    inadmissible_nuova
    unparsed_canon_substitution
    permission_bypass
    naming_separation_failure

------------------------------------------------------------

FINAL NUOVA AREPO LAW
------------------------------------------------------------

If invention cannot be separated from canon:

    INSUFFICIENT ADMISSIBILITY

============================================================
END OF ARTIFACT
============================================================
