Logic
The Name-and-Claim Game
A Representational Logic for Admissible Knowledge Construction
Status: Core Programme Statement
This page defines the logical foundation of Dot Theory.
It introduces the Name-and-Claim Game as a representational logic governing how distinctions become objects of reasoning, how claims become admissible, and how representational failure can be identified and corrected.
Dot Theory as a whole is the research programme developed from this logic.
As a logic, it does not propose new physical laws. It proposes a formal way of evaluating whether theories and representations remain adequate for the claims constructed from them. It provides a formal method for comparing, translating, and evaluating representations across frameworks.
For the mathematical treatment of contextual objects see:
https://www.dottheory.co.uk/paper/conditional-set-theory
For the epistemic foundations:
https://www.dottheory.co.uk/paper/the-invention-of-truth
For implementation and evaluation:
https://www.dottheory.co.uk/paper/context-sensitive-modelling-in-practice
For optimisation geometry:
https://www.dottheory.co.uk/paper/cost-homotopy
For institutional and governance implications:
https://www.dottheory.co.uk/paper/a-modern-constitution
Introduction
Before a thing can be measured, modelled, discussed, regulated, optimised, criticised, or believed, it must first become an object within a system of reasoning.
This process is so common that it is rarely examined directly.
A disease receives a name.
A particle receives a symbol.
A legal category receives a definition.
A social movement receives a label.
A mathematical structure receives notation.
Only then does systematic reasoning become possible.
The act of naming does not create the underlying phenomenon.
It creates a stable handle through which the phenomenon may enter a representational system.
Once named, claims can be made.
Predictions can be generated.
Institutions can act.
Models can be constructed.
Resources can be allocated.
The Name-and-Claim Game refers to this process.
It is not a metaphor.
It is a logical protocol describing how distinctions become objects of inference.
The Name-and-Claim Logic
The logic consists of two operations.
Name
A distinction is selected from a broader field of possibilities and bound to a representational object.
Claim
The representational object is treated as if it supports inference, prediction, explanation, or action.
Together these operations generate knowledge systems.
The crucial question becomes:
When is this process justified?
The answer is not:
"When the name exists."
Nor:
"When the claim is persuasive."
The answer depends upon representational adequacy.
Representation and Projection
Every representation suppresses distinctions.
No model captures everything.
No measurement captures everything.
No description captures everything.
Representation therefore requires projection.
Let:
Ω
denote the distinction space associated with a domain of inquiry.
(See: [Ω Distinction Space])
Let:
A(O,C) ⊂ Ω
denote the accessibility domain available to observer O under context C.
(See: [Accessibility Domain])
A representation selects some distinctions and suppresses others.
This process may be written:
π : Ψ → ψ
where:
Ψ = (ψ, μ)
and μ represents contextual structure.
(See: [Observer-Relative Accessibility], [Contextual Admissibility] in the sublexicon)
The central question of the Name-and-Claim Logic is therefore:
Which distinctions may be safely suppressed?
The Admissibility Criterion
The logic proposes a simple principle.
A representation is admissible only when the distinctions it suppresses are irrelevant to the observational law under consideration.
Formally:
If
π(Ψ₁) = π(Ψ₂)
then
P(y│Ψ₁) = P(y│Ψ₂)
must also hold.
When this condition fails, representational adequacy fails.
Two states have been treated as identical despite producing different observable outcomes.
The resulting claim becomes structurally unreliable.
This is not a semantic error.
It is a representational error.
(See: [Admissibility], [Projection], [Residual Structure] in https://www.dottheory.co.uk/paper/lexicon and https://www.dottheory.co.uk/paper/sublexicon)
The Failure Rule
The Name-and-Claim Logic contains an explicit failure condition.
A claim becomes inadmissible when distinctions erased during naming continue to influence the outcomes of interest.
This occurs whenever:
Ψ₁ ≠ Ψ₂
while
π(Ψ₁) = π(Ψ₂)
and
P(y│Ψ₁) ≠ P(y│Ψ₂)
In such cases the name has collapsed distinctions that remain operationally relevant.
The claim may still appear coherent.
It may even appear successful.
Yet the underlying representation is inadequate.
The Correction Rule
The response is not rejection.
The response is extension.
Additional distinctions must be incorporated into the representational structure until the projection no longer collapses outcome-relevant differences.
This is the logic behind:
contextual modelling,
personalised medicine,
adaptive control,
observer-sensitive systems,
interoperability analysis,
and much of modern machine learning.
Dot Theory proposes that this principle is more general than its individual applications.
Dot Theory
Dot Theory is the research programme built upon the Name-and-Claim Logic.
Its central objects include:
Ω Distinction Space
Accessibility Domains
Projection
Residual Structure
Admissibility
Communicable Reality
The Dot Operator
These objects provide a formal language for analysing when naming remains adequate and when claims become unreliable through projection loss.
Why Existing Logic Is Not Enough
Classical logic evaluates propositions.
Probability theory evaluates uncertainty.
Bayesian reasoning evaluates belief revision.
Game theory evaluates strategic interaction.
Each is powerful within its domain.
Dot Theory does not seek to replace them.
It addresses a prior question.
Before a proposition can be evaluated, before uncertainty can be quantified, before beliefs can be updated, and before strategies can be chosen, something must first become an object of reasoning.
A distinction must be selected.
A representation must be constructed.
A name must be assigned.
The Name-and-Claim Logic evaluates the adequacy of that process.
Its central question is therefore not:
"Is this claim true?"
but:
"Was the representation from which this claim was derived adequate for the claim being made?"
Where existing logical systems and theories evaluate reasoning performed within a representation, the Name-and-Claim Logic evaluates the construction of the representation itself. This is what it demonstrates provocatively with the toy proposal: E = 𝑚⊙ 𝑐³ in: https://www.dottheory.co.uk/paper/full-mathematical-paper-short-form
In this sense, it operates one layer earlier.
It is a logic of representational admissibility.
Why This Matters
Most disagreements are not disagreements about reality.
They are disagreements about shared and perceived representations of reality and the clusters of data we use to define them.
Different observers:
select different distinctions,
suppress different distinctions,
construct different names,
and therefore generate different claims.
The Name-and-Claim Logic does not eliminate disagreement.
It provides a method for diagnosing where disagreement originates.
The question shifts from:
"Who is correct?"
to:
"What distinctions were preserved, and what distinctions were suppressed?"
This shift is foundational to Dot Theory, the programme and its website are its expression.
In Closing
The Name-and-Claim Game is the logical foundation of Dot Theory.
It describes how distinctions become names, how names become claims, and how claims become admissible or inadmissible under projection.
Dot Theory extends this logic into a broader framework for analysing accessibility, representation, residual structure, interoperability, governance, and communicable reality.
The central proposition is simple:
Every claim depends upon a representation.
Every representation suppresses distinctions.
The legitimacy of a claim therefore depends upon whether the suppressed distinctions matter.
The Name-and-Claim Logic provides a formal method for asking that question.
To explore the site overall please visit: https://www.dottheory.co.uk/project-overview and https://www.dottheory.co.uk/paper/welcome
Greater detail and for reference:
A minimal formal scaffold to relate to physics, in a programme-safe way
This section is given for reference.
Let:
ℋ be a conventional state space
ψ ∈ ℋ be a standard state
ℳ be a metadata space
μ ∈ ℳ be contextual metadata
𝒮 ≔ ℋ × ℳ be an extended state space
Ψ = (ψ, μ) ∈ 𝒮 be an extended state
Let π : 𝒮 → ℋ be the projection π(Ψ) = ψ.
The key representational question becomes:
When does π discard information required to predict observables of interest?
Clarification: latent state vs contextual structure
The distinction between ψ and μ is not intended to duplicate the notion of latent state used in standard state-space models. In many existing frameworks, hidden variables are absorbed into an expanded state representation.
The distinction introduced here is structural rather than notational.
A latent state is typically defined as the set of internal variables required to make the system Markovian. In contrast, μ represents contextual structure that may remain external to ψ under standard modelling choices, including measurement conditions, regime variables, and observer-dependent constraints.
The representational question is therefore not whether such variables can be included in principle, but whether treating them as implicit or external leads to loss of predictive adequacy under projection.
That can be formalised as an identifiability or observability problem:
Distinct extended states Ψ₁ ≠ Ψ₂ may project to the same ψ while producing different distributions over observables in the regimes we care about.
What appears as domain-specific best practice, such as in personalised medicine, is in fact a manifestation of a deeper structural constraint that is not typically made explicit: that for partially observed or context-dependent systems, any stable account must incorporate not only the system state, but the context within which that state is interpreted. Context is not an auxiliary addition, but a condition of adequacy for representation, inference, and truth.
When distinct extended states project to the same nominal state but yield different observables, modelling solely in ℋ is representationally lossy.
This claim is testable once ℳ and the dynamics on 𝒮 are specified. Defining these formally is beyond the scope of this work, but is in principle feasible and presented across the website.
What would count as success, and what would count as failure
Dot Theory is not validated by rhetoric or breadth. It is validated by a narrow checklist:
Success conditions
A precise definition of metadata space ℳ in a concrete domain
A coherent extension of dynamics on 𝒮
Recovery of the standard model as a limiting case in regimes where μ is irrelevant
A discriminable prediction ΔO that differs from the reduced model
A falsification condition stated in advance
Failure conditions
No definable ℳ that improves prediction under controlled tests
No coherent dynamics that preserve the required symmetries
No discriminable predictions
Retrospective fitting without falsification criteria
This is the discipline required for a programme that wants to be taken seriously.
A Representation Adequacy Criterion for Context-Augmented State Spaces
Let ℋ be a state space, ℳ a contextual space, and 𝒮 ≔ ℋ × ℳ the extended state space. Let Ψ = (ψ, μ) ∈ 𝒮 and let π : 𝒮 → ℋ be the projection π(Ψ) = ψ. Let y denote an observable with conditional distribution P(y ∣ Ψ).
Definition (Representation adequacy):
The representation ℋ is adequate for the prediction of y if there exists a conditional distribution Q(y ∣ ψ) such that, for all Ψ ∈ 𝒮;
P(y ∣ Ψ) = Q(y ∣ π(Ψ)) = Q(y ∣ ψ)
Equivalently, ℋ is adequate if
π(Ψ₁) = π(Ψ₂) ⟹ P(y ∣ Ψ₁) = P(y ∣ Ψ₂)
for all Ψ₁, Ψ₂ ∈ 𝒮.
Criterion (Representation inadequacy under projection)
If ∃ Ψ₁, Ψ₂ ∈ 𝒮 such that
Ψ₁ ≠ Ψ₂,
π(Ψ₁) = π(Ψ₂),
but
P(y ∣ Ψ₁) ≠ P(y ∣ Ψ₂),
Then any model defined solely on ℋ is representationally inadequate for predicting y.
This criterion formalises the failure mode described in the Game-theoretical ‘Name-and-Claim Game’. Naming a system here corresponds to selecting a state ψ while suppressing contextual distinctions μ. Where this suppression collapses distinctions that alter the observational law P(y ∣ Ψ), the resulting claims are systematically unreliable but identifed. The error is not merely semantic, but structural and diagnostic: it arises from representational inadequacy under projection but gives shape to values. The game is then not won with certainty by avoiding error, but by making only those errors that, in the event, did not matter.
Interpretation
A representation is adequate only if all distinctions it suppresses are irrelevant to the observational law. If contextual variation μ alters P(y ∣ Ψ) while being erased by π, then modelling solely in ℋ is representationally lossy. In such cases, context-augmented representations Ψ = (ψ, μ), or equivalent structures that preserve these distinctions, are necessary for accurate or well-calibrated prediction.
Closing
The Name-and-Claim Game is a compact theoretical way to describe a non-trivial and serious point developed across this project:
Representation is an action. It selects what is counted, determines what is ignored, and constrains what can matter for inference and outcome. Dot Theory is a programme to make that action explicit, formal, and testable.
If the programme is wrong, it should fail cleanly under the conditions where its claims apply. If it is right in specific regimes, it should yield measurable improvements in prediction and control.
Either outcome is informative. Dot Theory is therefore presented as a representational programme, instantiated across this site and subject to evaluation under the conditions stated above.
Appendix
Presenting: a restrained “formal proof” statement:
Rather than offering a long pseudo-proof with speculative physics constants, I will state the logical core as a lemma and an implication:
Lemma (Projection loss).
Let Ψ = (ψ, μ) ∈ 𝒮 = ℋ × ℳ and π(Ψ) = ψ. If there exist Ψ₁ ≠ Ψ₂ such that π(Ψ₁) = π(Ψ₂) but the induced distributions over an observable O differ, then a model defined solely on ℋ is representationally incomplete for predicting O in that regime.
Implication (Need for extension).
In any domain where the lemma holds for observables of interest, extending the state representation to include a formally defined μ is warranted as a research direction. Whether it improves prediction is an empirical and utilitarian question.