Non-Reducibility and Operational Semantics in Retentive Formalisms: A No-Go Analysis for Post-Dynamic Retention
Abstract
This paper establishes the non-reducibility of retentive formalisms under the Non-Violation Criterion (Ψ-NVP). Building on the minimal framework introduced in Article I, the work provides explicit operational semantics for protocol time (τ) and the interaction indicator (I), clarifying admissible protocol transitions independently of physical time, information processing, or optimization objectives. Using these semantics, a series of no-go results is derived, demonstrating that any exact reduction of retention to standard dynamical, informational, or optimization frameworks necessarily violates Ψ-NVP. The analysis shows that retention does not constitute a reformulation of existing theories but defines a distinct operational class characterized by constraint-based admissibility rather than equations of motion or objective functions. The paper serves as a formal protection of the retentive framework against conceptual reduction and misuse.
Fields of Study & Subjects
Advanced Authentication Protocols Security
Formal Methods in Verification
Distributed systems and fault tolerance
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 7 January 2026
- Language
- EN