DC-NO.LT Layer-Theory of Placement-Devices: An Algorithmic Architecture

DC-NO.LT Layer-Theory of Placement-Devices is a contractive, self-limiting metatheoretical algorithmic architecture whose object of study is textual theoretical systems—termed placement-devices—whose anchored domain can be articulated in propositional form. The architecture forms a closed loop built upon nine primitives, seven axioms (A1–A7), an eight-operator suite (O0–O7), the K-REDUCE kernel-reduction protocol, three prior criteria, a dual-track scoring system, dual-axis circuit-breakers with the ρ-criterion, and a graded register of seventeen defeasible clauses (F1–F17). The architecture itself counts as a placement-device, subject to its own axioms with no transcendent standing. All internal outputs are Tier-0 in-frame self-tests; full empirical verification authority resides externally. Two independent threshold sets are maintained. At the primitive layer, the heuristic empirical threshold Π* = 0.30 defines grey-boundary objects (diverted at the pre-filter stage, never entering scoring). At the disposition layer, three thresholds (0.40, 0.70, 0.93) yield seven disposition types. Adjudicative scoring (governing disposition) is strictly separated from comparison scoring (reserved solely for intellectual-history similarity ranking), with an anti-overreach theorem attached. The O0 isomorphism-recognition operator serves as a pre-filter admission device: contractive, it delivers only negative screening and no affirmative judgement—with every isomorphic body recognised, the examinable range contracts by one measure. K-REDUCE preserves all equivalent minimal kernels for cyclic devices rather than forcing a unique solution. The Third Status distinguishes pseudo-form evasion from genuine acknowledgement of incapacity, is constrained by C1–C5 credibility rules, and is excluded from AI-index pseudo-form statistics. The ρ-criterion and dual-axis circuit-breakers adjust only audit-trigger thresholds without adjudicating result correctness. The defeasible-clause register pre-specifies conditions for system-overturning (F1–F5, F9), component-downgrading (F6, F10, F14, F15) and procedural violation (F7, F8, F11–F13, F16–F17); drawn up prior to any external criticism, it accords no equal force to conditions appended after the fact. In reflexive governance, the Contraction Dilemma Theorem proves that a self-referential recogniser rejecting contraction inevitably falls into self-exemption or infinite regress; the Self-Reference Defensive Closure Theorem seals off escape via higher-order reflection; within the Auto-Immunity Index system (SI / SB / AI), AI(LT) > 0 would trigger wholesale overturning, which is not currently established owing to insufficient sample (n = 1 < 5). The Relative Ascension Theorem holds that only relational orders relative to object-devices exist—there is no absolute third order. The legislative coordinate-corpus is legislation rather than a layer, and the layer stack terminates beneath it. Seven structural limitations are framed as intrinsic architectural features rather than defects; a meta-protection clause assigns the burden of proof to anyone claiming to have eliminated such limitations. Four internal audit protocols detected and repaired eight defects; internal unclosed items stand at zero, yet Protocol III was not passed, so this version may not claim that quality standards have been met; the level of evidence is Tier Zero. Highest Evidentiary Layer (Zenodo): 10.5281/ZENODO.21982945