Powered by OpenAIRE graph
Found an issue? Give us feedback
ZENODOarrow_drop_down
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
versions View all 3 versions
addClaim

Carrier-Free Reflexive Closure: A Minimal Foundation for Stabilization and Representability

Authors: Treppiedi, Attilio;

Carrier-Free Reflexive Closure: A Minimal Foundation for Stabilization and Representability

Abstract

Translator This note develops a carrier-free formulation of reflexive closure in which stabilization and representability are treated as contingent structural outcomes rather than assumed primitives. No state space, algebraic carrier, geometric background, or semantic domain is presupposed. The framework introduces only minimal pre-representational scaffolding—admissible composition of acts, resolution-indexed indistinguishability, and closure as propagation of operational consequences—and isolates the conditions under which closure may stabilize. Stabilization is defined as exhaustion of distinguishability under iterated closure and is not assumed to occur generically. Partial stabilization, resolution dependence, and local failure of reflexivity are treated as structurally natural possibilities rather than pathologies. Representational structures, including mathematical formalisms, linguistic articulation, and finite-resolution physical regimes, are presented as downstream realizations that arise only once stabilization occurs within a chosen representational environment. The role of this note is foundational and clarificatory. It does not propose new physical laws or mathematical constructions, nor does it privilege any specific realization. Instead, it provides a minimal structural layer intended to underlie and contextualize subsequent work on invariant stabilization, language and symbolic continuation, and finite-resolution physics. The framework is explicitly provisional and open to refinement, and is released as a citable reference point rather than a closed or complete theory.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!