research programme
A Contextual Admissibility Research Programme for Locally Generated Operational Procedures
Stefaan Vossen in collaboration with the IPI
25 May 2026
Abstract
This paper presents a formal research programme for the study of contextual admissibility and locally generated operational procedures under conditions of constrained informational accessibility, projection-loss, observer embedding, and incomplete recoverability.
The programme arises from a recurring instability across scientific, computational, phenomenological, and philosophical domains: explanatory conflict frequently emerges not because competing frameworks are directly contradictory, but because they operate under distinct informational accessibility conditions, preserve different operational invariants, admit different recoverability structures, and generate distinct admissible procedures relative to different question geometries.
Conventional scientific methodology generally assumes that operational procedures exist independently of the contextual conditions under which they are deployed. The present programme rejects this assumption. Instead, it proposes that operational procedures are themselves locally generated admissible constructions emerging under constrained informational interaction between:
• question structure,
• contextual embedding,
• informational accessibility,
• recoverability conditions,
• observer-relative restriction,
• and projection-preserving admissibility constraints.
The programme therefore proposes a foundational inversion:
methodological legitimacy is not globally pre-given, but conditionally generated under contextual informational restriction.
The purpose of this paper is not to present a completed mathematical theory. Rather, it establishes:
• the foundational architecture,
• the governing principles,
• the admissibility conditions,
• the operational primitives,
• the empirical discipline,
• and the formal mathematical requirements
necessary for a future rigorous implementation.
The programme defines the research domain within which contextual admissibility may be studied systematically across physics, artificial intelligence, systems theory, phenomenology, cognitive science, information theory, philosophy of science, and recursively embedded observational systems.
1. Introduction
A persistent assumption underlying much of scientific methodology is that explanatory procedures exist independently of the contextual conditions under which they are deployed.
Within conventional methodology, the following structure is typically assumed:
theory → method → observation → interpretation
Under this architecture:
• theories are presumed to possess stable operational meaning,
• procedures are treated as universally deployable,
• observational structure is assumed to remain sufficiently invariant,
• and disagreement is interpreted primarily as contradiction between competing truth claims.
However, contemporary interdisciplinary problems increasingly reveal limitations in this assumption.
Many apparent theoretical conflicts arise despite:
• preserving different informational invariants,
• operating over different contextual domains,
• resolving different forms of indeterminacy,
• maintaining different admissibility conditions,
• and generating different operational procedures relative to different question structures.
Consequently, many explanatory conflicts may arise not from contradiction, but from contextual non-equivalence.
This research programme therefore advances a different foundational assumption:
Operational procedures are not universally pre-given structures.
Instead:
Operational procedures are locally generated admissible constructions emerging under constrained informational accessibility and contextual recoverability conditions.
The programme therefore shifts methodological emphasis away from static ontology and towards conditional operational admissibility.
The central research question becomes:
Under what informational and contextual conditions does an operational procedure become admissible?
2. Foundational Inversion
The programme begins from a methodological inversion.
Classical methodological realism assumes:
• stable systems,
• stable observational categories,
• stable procedures,
• and context-independent operational deployment.
The present framework instead proposes:
• question-relative operational generation,
• contextual informational accessibility,
• observer-relative recoverability,
• projection-sensitive operational geometry,
• and locally generated admissibility structures.
Operational procedures therefore do not exist independently of contextual informational conditions.
Rather, they emerge through constrained interaction between:
• the structure of the question,
• the informational structures accessible,
• the contextual embedding of the observing system,
• the admissibility constraints governing recoverability,
• and the residual structures preserved under operational reduction.
The programme consequently replaces universal procedural realism with conditional operational admissibility.
3. Fundamental Operational Configuration
The programme introduces the operational configuration:
Ω = (Q, Ψ, μ, 𝒜)
where:
• Q denotes question structure,
• Ψ denotes informational state-space,
• μ denotes contextual embedding,
• 𝒜 denotes admissibility constraints.
These objects are not yet treated as fully formalised mathematical entities within this paper. Their precise formal implementation constitutes part of the subsequent mathematical research programme.
However, the architecture requires that:
• Q defines operationally distinguishable interrogative structure,
• Ψ defines accessible informational configuration space,
• μ defines contextual-operational embedding conditions,
• and 𝒜 defines admissibility restrictions governing operational legitimacy.
Operational reduction is defined through projection:
π : (Q, Ψ, μ) → ψ
where ψ denotes reduced operational representation.
The programme establishes the following central principle:
Projection may destroy not merely information, but admissible operational computability itself.
Consequently:
π(Ψ₁) = π(Ψ₂) = ψ ⇏ P(O ∣ Ψ₁) = P(O ∣ Ψ₂)
Reduced equivalence therefore does not imply operational equivalence.
4. Contextual Informational Accessibility
The programme proposes that informational accessibility is inherently contextual.
No observer, procedure, or model possesses unrestricted informational access.
Define:
𝓘(Q, Ψ, μ)
as the informational domain operationally accessible under question structure Q and contextual condition μ.
Distinct contextual embeddings preserve distinct informational domains.
Consequently:
• different procedures may become admissible under different accessibility conditions,
• distinct explanatory systems may preserve different recoverability structures,
• and operational legitimacy becomes context-relative rather than universally deployable.
The programme therefore rejects unrestricted procedural universalism.
5. Local Operational Generation
The central claim of the programme is that admissible operational procedures are generated locally.
Define the contextual admissibility operator:
Λ : (Q, Ψ, μ, 𝒜) → 𝒫ₗₒ𝒸
where:
• Λ denotes admissibility generation,
• 𝒫ₗₒ𝒸 denotes locally admissible operational procedure space.
The role of admissibility generation is not merely to select between pre-existing theories.
Rather:
Admissibility structures generate the locally deployable operational configuration relative to contextual informational conditions.
The programme therefore proposes:
There may not exist a universally admissible global operational procedure.
Instead:
operational procedures may exist only locally within constrained contextual informational domains.
6. Admissibility Conditions
The programme defines admissibility not as metaphysical truth, but as operational legitimacy under constrained informational conditions.
A procedure is admissible only if:
• operational distinctions remain recoverable,
• projection-loss remains explicitly constrained,
• predictive deployment remains operationally stable,
• and residual informational structures remain preserved.
Admissibility therefore depends upon:
• informational accessibility,
• contextual embedding,
• observer-relative recoverability,
• projection-loss tracking,
• and residual preservation.
The programme explicitly distinguishes:
inadmissibility from falsity.
A procedure may become inadmissible not because it is false, but because the informational conditions necessary for meaningful deployment are absent.
7. Residual Preservation
Residual structures denote unresolved informational structure not recoverable under a given admissible operational configuration.
Define:
R = Ω ∖ 𝒫ₗₒ𝒸
Residuals are not treated as eliminable error terms.
Rather:
they represent unresolved operational structure preserved under constrained recoverability.
Residual preservation prevents:
• premature explanatory closure,
• illegitimate reduction,
• false equivalence between frameworks,
• and artificial ontological collapse.
The programme therefore prioritises disciplined residual accounting over forced unification.
8. Contextual Sheaf Structure
The programme proposes that the mathematical structure most naturally compatible with contextual admissibility is sheaf-like operational geometry.
Let:
• U denote a contextual informational domain,
• 𝓕(U) denote locally admissible operational procedures over U.
Distinct contextual domains may preserve:
• distinct informational accessibility,
• distinct admissibility conditions,
• distinct recoverability structures,
• and distinct operational procedures.
Restriction mappings are defined as:
ρᵁⱽ : 𝓕(U) → 𝓕(V)
for contextual restriction V ⊆ U.
The programme hypothesises:
Operational procedures behave as local admissible sections over contextual informational domains.
The central research implication is therefore:
Global admissible operational sections may not exist.
Only locally admissible operational constructions may exist.
The precise mathematical formalisation of this structure constitutes a major objective of the subsequent mathematical programme.
9. Projection-Loss and Operational Destruction
Under conventional reductionism, projection is frequently interpreted as simplification.
The present programme proposes instead:
Projection alters operational informational geometry.
Projection may therefore destroy:
• admissible distinctions,
• recoverability conditions,
• contextual accessibility,
• and operational computability itself.
Reduction therefore does not merely compress informational structure.
Reduction may eliminate the conditions under which operational procedures become admissible.
This principle provides a potential explanation for persistent interdisciplinary incompatibilities where reduced descriptors overlap while operational geometries diverge.
10. Recursive Observer Embedding
A central principle of the programme is recursive observer embedding.
The system generating admissibility procedures remains embedded within the same informational restrictions governing the systems it evaluates.
Define:
R₀ : Recursive Self-Embedding Constraint
No admissibility architecture may fully externalise itself from the contextual informational conditions governing its own operational deployment.
The programme therefore rejects:
• absolute procedural neutrality,
• unrestricted external realism,
• and fully context-free epistemology.
Recursive epistemic limitation is preserved explicitly rather than concealed beneath methodological absolutism.
11. Question-Relative Operational Geometry
Within the programme:
questions are not passive linguistic descriptions.
Question structure partially determines:
• admissible informational accessibility,
• recoverability conditions,
• operational geometry,
• and admissible procedure generation.
Distinct question structures may therefore induce:
• different operational domains,
• different admissibility conditions,
• and different explanatory procedures.
Scientific disagreement may therefore emerge not merely from incompatible answers, but from incompatible operational question geometries.
12. Empirical Discipline
The programme does not reject empirical science.
Observed outcome-space recursively constrains:
• admissibility,
• recoverability,
• predictive legitimacy,
• and procedural deployment.
The proposed operational evaluation structure is:
Define question structure Q.
Define contextual accessibility domain 𝓘(Q, Ψ, μ).
Generate locally admissible procedures Λ.
Apply operational projection π.
Compute observable outcome-space O.
Track residual structure R.
Evaluate admissibility stability.
Classify the procedure as:
• admissible,
• inadmissible,
• underdetermined,
• or context-shifted.
Empirical interaction therefore remains essential because admissibility itself is recursively constrained by operational outcome-space.
13. Comparative Framework Interoperability
The programme permits heterogeneous explanatory systems to coexist without forced equivalence.
Distinct frameworks may:
• preserve different invariants,
• operate over different contextual domains,
• resolve indeterminacy at different operational layers,
• and generate distinct admissible procedures.
Apparent contradiction may therefore reflect:
• contextual non-equivalence,
• projection-loss,
• operational divergence,
• or question-relative incompatibility.
Comparative analysis becomes possible only where:
• admissibility conditions remain compatible,
• operational invariants remain preserved,
• and residual structures remain explicitly tracked.
14. Formal Mathematical Programme
The present paper establishes the conceptual and operational architecture only.
The subsequent mathematical programme must rigorously define:
• admissibility spaces,
• contextual topology,
• operational morphisms,
• projection operators,
• residual mappings,
• admissibility metrics,
• gluing conditions,
• obstruction structures,
• local/global admissibility relations,
• and computability conditions.
Particular mathematical directions include:
• sheaf theory,
• category-theoretic operational morphisms,
• contextual topology,
• partial information geometry,
• recursive admissibility logic,
• and constrained operational semantics.
The present paper therefore functions as a formal research programme specification rather than a completed mathematical implementation.
15. What the Programme Does Not Claim
The programme does not claim:
• a final ontology,
• unrestricted relativism,
• unrestricted equivalence between symbolic systems,
• elimination of empirical science,
• complete explanation of consciousness,
• or unrestricted procedural flexibility.
Instead, the programme proposes:
a disciplined admissibility architecture governing the local generation of operational procedures under incomplete informational recoverability.
16. Central Thesis
The central thesis of the programme may therefore be stated as follows:
Operational procedures are not universally pre-given structures.
They are locally generated admissible constructions emerging under conditions of:
• contextual informational accessibility,
• question-relative operational geometry,
• observer-embedded recoverability,
• projection-sensitive reduction,
• residual preservation,
• and admissibility-constrained informational interaction.
No universally context-free operational procedure may exist.
Knowledge therefore emerges through locally admissible interaction with constrained informational structure.
17. Conclusion
This paper has proposed a contextual admissibility research programme for locally generated operational procedures under constrained informational accessibility and incomplete recoverability.
The programme introduces:
• contextual operational admissibility,
• local procedural generation,
• residual-preserving methodology,
• projection-sensitive operational geometry,
• recursive observer embedding,
• and contextual sheaf-like informational structure
as foundational components of operational knowledge.
This programme does not present a completed formal theory. The formal theory is available here
Rather, it establishes:
• the foundational inversion,
• the admissibility architecture,
• the operational primitives,
• the empirical discipline,
• and the mathematical requirements
necessary for future rigorous implementation.
Its primary contribution lies in reframing scientific methodology itself:
not as universally context-free procedural deployment,
but as constrained admissible interaction with informational structure under recursive contextual restriction.
The programme therefore proposes not a final theory of reality,
but a disciplined architecture for navigating operational admissibility under incomplete informational recoverability.
Acknowledgements
This research programme emerged through extensive interdisciplinary discussion concerning contextual informational accessibility, operational admissibility, recursive epistemology, phenomenological selection, projection-loss analysis, contextual systems modelling, observer-relative recoverability, and informational constraint structures.
Conceptual influence arose from ongoing exchanges across:
• physics,
• information theory,
• artificial intelligence,
• phenomenology,
• philosophy of science,
• contextual systems modelling,
• recursive operational architectures,
• and representational constraint theory.
The remaining unresolved residuals, formal incompletenesses, and interpretive limitations remain the responsibility of the author.
