research programme

A Research Programme for Contextual Admissibility and Locally Generated Operational Procedures

Stefaan Vossen in collaboration with the IPI

25 May 2026

Abstract:

This paper presents a formal research programme architectural specification 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.

Beneath these differences lies a further source of explanatory instability that receives comparatively little explicit treatment.

Scientific reasoning routinely moves between representations belonging to different explanatory domains. Mathematical constructions become physical models. Computational structures become biological hypotheses. Observational procedures become empirical claims. Logical systems become governance architectures.

These transitions are frequently treated as implicit or self-evident.

The present programme proposes instead that they constitute representational operations carrying their own admissibility burden. The transition between representational domains is therefore treated as an object of investigation rather than an unexamined assumption.

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?

Because many frameworks discussed throughout this programme employ overlapping terminology while preserving distinct operational structures, a separate Minimal Operational Lexicon has been developed alongside the present architecture. The lexicon is not intended to impose universal definitions across frameworks, but rather to preserve contextual admissibility during comparison, translation, and interoperability analysis between partially overlapping representational systems.

2. Foundational Inversion

The programme begins from two methodological inversions.

The first concerns operational admissibility:

Classical methodological realism generally assumes:

• stable systems,

• stable observational categories,

• stable procedures,

• and context-independent operational deployment.

The present programme 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.

The second inversion concerns representational transition.

Scientific reasoning routinely moves between mathematical constructions, physical models, computational structures, observational procedures, empirical claims, and governance architectures. These transitions are often treated as implicit or self-evident.

The present programme rejects that assumption.

Mathematical objects, physical objects, computational objects, observational objects, and governance objects belong to distinct representational categories. The transition between such categories is not an identity but a declared representational operation.

Consequently, mathematical coherence alone does not establish physical ontology.

Rather, a mathematical construction becomes a candidate physical model only through an explicitly declared representational transition satisfying identifiable admissibility conditions.

Representational transitions therefore become first-class objects of investigation.

Such transitions possess their own:

• provenance,

• scope,

• admissibility conditions,

• preserved invariants,

• generated residuals,

• observational commitments,

• and failure conditions.

The programme therefore studies not only mathematical structures and physical theories, but also the representational operations through which mathematical, computational, observational, and conceptual structures become admissibly associated with physical interpretation.

This principle extends beyond physics. It applies equally to artificial intelligence, systems theory, phenomenology, philosophy of science, governance, and interdisciplinary framework comparison wherever representational structures are translated between explanatory domains.

3. Representational Transition Principle

The programme explicitly distinguishes between mathematical objects, computational objects, representational objects, and physical objects.

Correspondence between these domains must not be assumed merely because a construction is internally coherent, computationally successful, or mathematically elegant.

A mathematical construction does not become a physical ontology simply by virtue of its consistency or explanatory power.

Rather, the transition between representational categories is itself treated as an operational object requiring explicit declaration and justification.

Representational transitions therefore possess their own admissibility conditions, provenance, scope, bridge conditions, residual structures, and failure criteria.

Consequently, whenever a framework moves between mathematical structures, computational implementations, physical interpretation, empirical observation, conceptual models, or governance objects, the representational operation performing that transition should itself be made explicit and available for evaluation.

The programme therefore treats representational transitions as first-class objects of scientific investigation rather than as implicit assumptions embedded within theoretical discourse.

This principle applies independently of any particular physical theory and is intended as a general methodological discipline governing the construction, interpretation, comparison, and extension of representational frameworks.

4. Fundamental Operational Configuration

The programme introduces the operational configuration:

Ω = (Q, Ψ, μ, ℛ, 𝒜)

where:

• Q denotes question structure.

• Ψ denotes informational state-space.

• μ denotes contextual embedding.

• ℛ denotes the representational regime through which accessible informational configurations become operationally available, comparable, communicable, and admissibly associated with mathematical, computational, observational, conceptual, or physical objects.

• 𝒜 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.

The inclusion of ℛ reflects the programme's second foundational inversion.

Informational accessibility alone does not generate operational claims.

Accessible information must first become representable before it can participate in observation, comparison, communication, computation, theoretical construction, or empirical evaluation.

Representational structure is therefore treated as an independent operational primitive rather than an implicit consequence of information or observation.

Representational transitions between mathematical, computational, physical, observational, conceptual, and governance domains consequently become explicit objects of admissibility analysis.

The architecture therefore requires that:

• Q defines operationally distinguishable interrogative structure.

• Ψ defines accessible informational configuration space.

• μ defines contextual-operational embedding conditions.

• ℛ defines the representational regime/architecture through which informational accessibility becomes operationally available.

• 𝒜 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 the representational conditions required for admissible operational computation.

Consequently,

π(Ψ₁, ℛ) = π(Ψ₂, ℛ) = ψ ⇏ P(O │ Ψ₁) = P(O │ Ψ₂)

Reduced representational equivalence therefore does not imply operational equivalence.

4.1 Why Representational Structure Matters

The present programme does not propose to replace mathematics, empirical science, or existing physical theories.

Rather, it proposes that an additional class of operational objects has historically remained implicit.

Many scientific and mathematical programmes move directly between ontology, formal mathematical construction, and empirical prediction. The representational operations connecting these domains are typically assumed rather than explicitly declared.

Dot Theory proposes that these representational transitions constitute legitimate objects of scientific investigation in their own right.

Rather than replacing existing methodology, the programme makes these transitions explicit so that they may themselves become subject to admissibility analysis, comparison, residual localisation, and empirical evaluation.

This distinction may be illustrated schematically.

Classical Scientific Architecture:

Ontology
 ↓
Mathematical Construction
 ↓
Prediction
 ↓
Empirical Evaluation

The representational transitions between ontology, mathematics, and empirical interpretation are typically treated as implicit.

Classical Formal Mathematical Architecture:

Mathematics
 ↓
Formal Structure
 ↓
Logical Consequences

The mathematical system is internally governed by formal consistency.

Its physical interpretation, where one is proposed, is generally treated as external to the mathematical construction itself.

Dot Theory Architecture:

Possibility Space (Ω)
↓
Representational Regime (ℛ)
↓
Representational Transition (RT)
 ↓ 
Representational Bridge (RB)
 ↓
Projection (π)
 ↓
Prediction
 ↓
Empirical Evaluation
 ↓
Residual Domain (ΛΞ)
 ↓
Residual Relation
 ↓
Residual Localisation
 ↓
Admissibility Evaluation (⊨)
 ↓
A / A* / CAF / BRF ...

As a table:

Classical Realism ‍ ‍Predictive Processing‍ Dot Theory

Begins with ontology Begins with representations Begins with possibility space (where ontology & repres. exist)

Mathematics models reality Models compete by prediction Representations are governed explicitly

Representation largely implicit Representation primary Representational transitions explicit

Prediction validates theory Prediction ranks representations Prediction exposes residuals

Failure revises theory Failure revises representation Failure localises residuals and evaluates admissibility

Asks "What exists?" Asks "What predicts?" Asks "What licences this representational transition?"

Caption: Comparison of methodological architectures. Classical scientific realism typically proceeds from ontology through mathematical formalisation to empirical prediction, leaving the representational transitions largely implicit. Predictive-processing approaches treat persistent predictive success as the organising principle for representations, with ontology becoming provisional. Dot Theory introduces an explicit governance layer in which representational regimes, transitions, bridges, projections, residuals, and admissibility become first-class operational objects. The programme therefore does not replace mathematics or empirical science, but extends their methodological architecture by making representational transitions themselves available for explicit declaration, comparison, localisation, and evaluation.

Within the present programme, representational regimes, representational transitions, representational bridges, and the operational machinery that performs them are treated as explicit governance objects rather than implicit assumptions.

Consequently, the transition from mathematical construction to physical interpretation is not regarded as automatically licensed by mathematical coherence, explanatory elegance, or empirical success alone.

Instead, these transitions become admissible operations requiring explicit declaration, provenance, scope, comparison conditions, bridge conditions, residual accounting, and failure criteria.

The programme therefore extends existing scientific methodology by making representational transitions themselves available for formal analysis, comparison, and empirical discipline.

Methodological Principle:Mathematical coherence licenses mathematics. Empirical success licenses predictive adequacy. Neither, by itself, uniquely licenses ontology. The representational transition between formal construction and ontological interpretation is therefore treated as an explicit object of admissibility analysis.

5. Contextual Informational Accessibility

The programme proposes that informational accessibility domain 𝒟 is inherently contextual.

No observer, procedure, model, or representational regime possesses unrestricted informational access.

Define:

𝒟(Q, Ψ, μ, ℛ)

as the informational domain operationally accessible under question structure Q, informational configuration Ψ, contextual embedding μ, and representational regime ℛ.

Informational accessibility is therefore not an absolute property of a system.

Rather, it emerges through the interaction between the question being posed, the information available, the contextual conditions under which observation occurs, and the representational regime through which that information becomes operationally available.

Distinct contextual embeddings preserve distinct informational domains.

Distinct representational regimes may likewise preserve different informational distinctions while rendering others operationally inaccessible.

Consequently:

• different procedures may become admissible under different accessibility conditions,

• distinct explanatory systems may preserve different recoverability structures,

• different representational regimes may generate different operational opportunities from the same informational substrate,

• and operational legitimacy becomes context-relative rather than universally deployable.

The programme therefore rejects unrestricted procedural universalism.

Operational accessibility is treated not as a universal property of reality, but as a contextual property emerging from the interaction between informational accessibility, representational regime, and admissibility.

6. 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 the locally admissible operational procedure space.

Admissibility generation does not merely select between pre-existing procedures.

Rather, admissibility structures generate the locally deployable operational configuration relative to the accessible informational domain and the representational regime through which that domain becomes operationally available.

Consequently, operational procedures are not treated as universal objects awaiting application.

They emerge through the interaction between:

• question structure,

• informational accessibility,

• contextual embedding,

• representational regime,

• and admissibility constraints.

The programme therefore proposes that there may not exist a universally admissible global operational procedure.

Instead, operational procedures exist only locally within constrained accessible informational domains and under explicitly declared representational regimes.

Operational universality therefore becomes a limiting case rather than the default assumption.

7. Admissibility Conditions

The programme defines admissibility not as metaphysical truth, but as the operational legitimacy of a representational procedure under explicitly declared conditions.

An operational procedure is admissible only insofar as:

• operational distinctions remain recoverable,

• representational transitions remain explicitly declared,

• projection-loss remains explicitly constrained,

• predictive deployment remains operationally stable,

• and residual informational structures remain preserved.

Admissibility therefore depends upon:

• accessible informational domains,

• contextual embedding,

• representational regime,

• observer-relative recoverability,

• projection-loss tracking,

• residual preservation,

• and explicitly declared operational scope.

The programme therefore distinguishes admissibility from truth, correctness, and empirical success.

A procedure may become inadmissible not because it is false, but because the informational, representational, or contextual conditions required for its meaningful deployment are absent.

Conversely, an admissible procedure is not thereby established as true. Admissibility determines whether an operation may be meaningfully performed under declared conditions, not whether the conclusions subsequently drawn are ultimately correct.

8. Residual Preservation

Residual structures denote representational or informational structure that remains unrecovered, unmatched, transformed, or otherwise preserved following a declared admissible operation.

Residuals therefore arise relative to an explicitly declared operational configuration rather than existing as intrinsic properties of a framework.

Given an admissible operational configuration Ω, an operational procedure 𝒫ₗₒ𝒸, and a declared projection π, residual structure is defined relative to the declared operation:

R = Residual(Ω, 𝒫ₗₒ𝒸, π)

The precise mathematical implementation of the residual operator forms part of the subsequent mathematical research programme.

Residuals are not treated as eliminable error terms.

Rather, they represent preserved operational structure whose recovery is constrained by the informational domain, representational regime, admissibility conditions, and declared operational procedure.

Residual preservation prevents:

• premature explanatory closure,

• illegitimate representational reduction,

• false equivalence between frameworks,

• artificial ontological collapse,

• and the concealment of undeclared assumptions.

Residuals therefore become positive objects of investigation rather than deficiencies to be eliminated.

The programme consequently prioritises disciplined residual localisation, declaration, and comparison over forced unification or premature theoretical convergence.

9. Contextual Sheaf Structure

One promising mathematical language for formalising contextual admissibility is sheaf-theoretic 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.

10. 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.

11. 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.

12. 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.

13. Empirical Discipline

The programme does not reject empirical science.

Rather, empirical interaction provides the recursive constraint through which representational regimes, admissibility conditions, operational procedures, and explanatory claims remain subject to continual evaluation and refinement.

Observed outcome-space recursively constrains:

• representational admissibility,

• operational legitimacy,

• recoverability,

• predictive stability,

• and procedural deployment.

The proposed operational evaluation architecture is therefore:

1. Define the question structure Q.

2. Establish the operational configuration Ω = (Q, Ψ, μ, ℛ, 𝒜).

3. Determine the accessible informational domain 𝒟(Q, Ψ, μ, ℛ).

4. Generate the locally admissible operational procedure Λ.

5. Apply the declared operational projection π.

6. Compute the observable outcome-space O.

7. Localise, declare, and classify the resulting residual R.

8. Evaluate admissibility stability under empirical interaction.

9. Refine the representational regime, admissibility conditions, operational procedure, or residual declarations where required.

Operational outcomes are therefore not regarded merely as confirmations or refutations of hypotheses.

They participate recursively in the refinement of representational regimes, operational procedures, admissibility conditions, and residual localisation.

Procedures may consequently be classified as:

• admissible,

• inadmissible,

• underdetermined,

• context-shifted,

• or requiring representational refinement.

Empirical interaction therefore remains indispensable, not because it directly establishes metaphysical truth, but because it recursively constrains the admissibility of operational claims through observable interaction with the world.

14. 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.

15. Formal Mathematical Programme

The present paper establishes the conceptual, operational, and governance architecture of the programme.

The mathematical programme that follows is concerned not merely with applying existing mathematical tools, but with providing rigorous formalisations of the operational objects introduced throughout this framework.

In particular, subsequent work will seek to formalise:

• admissibility spaces,

• representational regimes,

• contextual accessibility domains,

• operational morphisms,

• representational transition operators,

• projection operators,

• residual mappings and residual classifications,

• admissibility metrics,

• bridge operators,

• local and global admissibility relations,

• contextual computability,

• and interoperability conditions between independently developed representational frameworks.

Potential mathematical languages suitable for these developments include:

• sheaf theory,

• category theory,

• contextual topology,

• partial information geometry,

• graph and network formalisms,

• recursive admissibility logic,

• constrained operational semantics,

• and related mathematical structures as appropriate.

No commitment is made at this stage to any single mathematical implementation.

Rather, the programme seeks mathematical structures capable of preserving the operational distinctions introduced throughout this work while making their admissibility, provenance, representational transitions, and residual behaviour formally recoverable.

The present paper should therefore be understood as a research programme specification and methodological foundation rather than as a completed mathematical theory.

16. What the Programme Does Not Claim

The programme does not claim:

• a final ontology,

• unrestricted epistemic relativism,

• unrestricted equivalence between representational systems,

• automatic correspondence between mathematical constructions and physical reality,

• elimination of empirical science,

• complete explanation of consciousness,

• unrestricted procedural flexibility,

• or a completed mathematical implementation.

Instead, the programme proposes a disciplined operational architecture within which questions, information, representational regimes, admissibility conditions, operational procedures, and residual structures may be explicitly declared, compared, and evaluated under conditions of incomplete informational recoverability.

Its purpose is not to determine what reality ultimately is, but to improve the conditions under which claims about reality become representationally explicit, operationally admissible, empirically recoverable, and meaningfully comparable.

The programme should therefore be understood as a methodological and representational framework for scientific inquiry rather than as a replacement for the scientific theories that it seeks to organise, compare, and refine.

17. Central Thesis

The central thesis of the programme may therefore be stated as follows.

Operational procedures are not universally pre-existing structures awaiting application.

They are locally generated admissible constructions emerging through the interaction between:

• question structure,

• accessible informational domains,

• contextual embedding,

• representational regimes,

• admissibility constraints,

• projection-sensitive operational reduction,

• residual preservation,

• and recursive empirical interaction.

Consequently, no universally context-independent operational procedure need exist.

Operational legitimacy is generated locally under explicitly declared informational, representational, and contextual conditions.

Scientific inquiry is therefore understood not as the application of universally pre-given procedures to an independently accessible reality, but as the disciplined generation, evaluation, comparison, and refinement of admissible operational structures under conditions of incomplete informational recoverability.

The programme consequently proposes a shift in emphasis.

Rather than asking whether a procedure is universally valid, it asks under what declared conditions that procedure becomes representationally explicit, operationally admissible, empirically recoverable, and meaningfully comparable.

18. 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 mathematical theory. Rather, it establishes the architectural and methodological foundation upon which such formalisations may subsequently be developed.

It establishes:
• the foundational inversion,
• the admissibility architecture,
• the operational primitives,
• the empirical discipline,
• the mathematical architecture
necessary for future formal 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.

For the programme manifesto please refer to: https://www.dottheory.co.uk/paper/manifesto

For the physics-facing research programme: https://www.dottheory.co.uk/physics-programme

For website orientation and navigation: https://www.dottheory.co.uk/paper/website-orientation

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 multiple platforms and disciplines:
• 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.