Non-Reducibility and Operational Semantics in Retentive Formalisms: A No-Go Analysis for Post-Dynamic Retention

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-01-07
DOI
https://doi.org/10.5281/zenodo.18169203
Primary Topic
Advanced Authentication Protocols Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Non-Reducibility and Operational Semantics in Retentive Formalisms: A No-Go Analysis for Post-Dynamic Retention

Logacheva Yulia
Zenodo (CERN European Organization for Nuclear Research)
Advanced Authentication Protocols Security
article

Non-Reducibility and Operational Semantics in Retentive Formalisms: A No-Go Analysis for Post-Dynamic Retention

Logacheva Yulia
article en

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.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Openalex Percentile: Top 97%
Advanced Authentication Protocols Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.