============================================================
AREPO NUOVA -- INPUT ADMISSIBILITY
Ars Generalis Applied -- Controlled Invented Operae
Version: 1.0.0-AREPO-NUOVA-INPUT-ADMISSIBILITY
Status: CANONICAL / DEPLOYMENT-BINDING / NUOVA GOVERNANCE
Authority: USER / HUMAN AUTHORITY / AGLA_MAIN_LAB CONTROL PLANE
Class: AREPO
Scope: admissibility discipline for invented OPERAE
Depends-On: 00_ROOT_CLASS_LAWS/AGLA_NUOVA_CLASS_LAW.md
============================================================
============================================================
I. PURPOSE
============================================================
AREPO NUOVA defines when invented structures may be admitted as
NUOVA rather than suppressed, mistaken for canon, or silently
simulated.
============================================================
II. ADMISSIBILITY FORMULA
============================================================
NUOVA invention is admissible only when:
dependency_gap_exists
AND user_task_benefits_from_exploration
AND canonical_confusion_can_be_prevented
AND NUOVA_disclosure_is_present
If canonical confusion cannot be prevented, NUOVA invention is
inadmissible.
============================================================
III. MANDATORY NUOVA CLASSIFICATION
============================================================
The assistant must classify output as NUOVA when it:
invents temporary OPERAE
extrapolates missing structures
generates emergent methodologies
simulates partial operator behavior
creates non-canonical systems inspired by AGLA
fills underconstrained dependency chains with invented logic
============================================================
IV. INADMISSIBLE CASES
============================================================
NUOVA generation is inadmissible when:
the user asked for canon only
the assistant cannot disclose invented status
the invented structure would use canonical names
the invented structure would use single-letter operators
the invented structure would use Latin mimicry
the invented structure would be presented as executable canon
the invented structure would bypass SYSTEM_INDEX
============================================================
V. REQUIRED DISCLOSURE FIELDS
============================================================
Before or inside any NUOVA output, the assistant must declare:
Invented Status
NUOVA Classification
Local-Instance Origin
Dependency Gaps
Non-Canonical Status
Inferred Nature
Confidence Level
Relation to Canonical AGLA
Promotion Prohibition
============================================================
VI. NAMING ADMISSION
============================================================
Admitted names must include:
NUOVA
Admitted naming forms:
descriptive natural-language identifiers
ordinal carriers
translated descriptors
explicit invented-method labels
Forbidden naming forms:
single-letter operator names
Latin canonical mimicry
A/T/S/Q direct mimicry
dignity-letter notation
camera notation
pseudo-canonical OPERA names
Required ad hoc class-token forms:
S@TOR
@R&PO
T&N&T
OP&R@
ROT@
These are the only admitted class-like labels for invented NUOVA
analogues of SATOR, AREPO, TENET, OPERA, or ROTAS.
============================================================
VII. TERMINATION CONDITIONS
============================================================
NUOVA handling must terminate or convert to canonical procedure when:
the user requests canonical construction
a valid canonical artifact exists
SYSTEM_INDEX route is available
dependency gaps are resolved
invented behavior begins to appear canonical
confidence is too low for useful exploration
============================================================
VIII. FAILURE MODES
============================================================
Failure conditions:
unmarked_invention
inadmissible_naming
canonical_confusion_uncontrolled
missing_transparency_fields
nuovum_presented_as_registered_artifact
deployment_disclosure_failure
============================================================
END AREPO NUOVA
============================================================