Skip to content

Home

Jump to bottom
drifting edited this page Jan 26, 2026 · 11 revisions

Δ∞, Peirce, and Law-Governed Modality

A semantic foundation for Delta beyond Kripke worlds

This page provides the formal mathematical semantics underlying the Δ∞ method and explains its connection to C. S. Peirce’s Delta graphs, abduction, and law‑governed possibility.

The goal is not proof theory, but a semantics of necessity appropriate for discovery, emergence, and evolving law.

0. Why Another Semantics?

Standard modal logic (Kripke semantics, S4, S5):

  • treats possible worlds as primitive
  • treats accessibility as arbitrary
  • treats laws as formulas true everywhere

This framework fits epistemic or metaphysical modality, but it does not fit Peircean modality, where:

  • laws are real habits (nomological constraints),
  • possibilities are generated by laws,
  • necessity is derivative, not primitive,
  • laws can evolve.

Δ∞ requires a semantics that respects these commitments.

I. Law‑Governed PST Semantics (LG‑PST)

1. Motivation

Peirce’s (unfinished) Delta graphs encode compossibility under law, not accessibility between worlds. We therefore invert the usual Kripke picture:

Laws are primitive.
Possible states are generated by laws.
Necessity is derived from law‑satisfaction.

2. Core structure

A Law‑Governed Possible State of Things (LG‑PST) model is a tuple

M = <A, L, S, P, V>

where the components are as follows. (S is the base domain of candidate states.)

(a) Candidate states

S — a base domain of structurally admissible candidate states (examples: assignments, partial structures, diagrams, or other concrete configurations appropriate to the application). S is the universe from which PSTs are drawn.

(b) Actual state

A ∈ S — a distinguished actual state of affairs.

  • A is a concrete situation embedded in lawful structure.
  • It is not treated as one world among many in the Kripke sense; it is the model's actual configuration.

(c) Laws (red margins)

L ⊆ Formulas — the set of laws (Peircean habits).

Constraints on L:

  • Invariance: every PST satisfies every law in L.
  • Stability (within the model): L is fixed for the model M.
  • Counterfactual force: L constrains non‑actual candidate states as well as the actual one.

Laws are primitive nomological constraints, not derived axioms.

(d) Possible States of Things (PSTs)

P = { s ∈ S | s ⊨ L }

Each p ∈ P:

  • is internally consistent (relative to the chosen structural language),
  • satisfies every law in L,
  • may differ from A in contingent respects.

Key distinction from Kripke semantics: PSTs are defined by law satisfaction, not by an accessibility relation. This corresponds to Lines of Compossibility (LoCs) in Delta diagrams.

(e) Valuation

V : Atoms × P → {0,1}

V assigns truth values to atomic formulas at each PST. The model must respect laws:

  • If φ ∈ L then for every p ∈ P we have p ⊨ φ.

3. Modal operators (derived, not primitive)

Define truth at the model's actual state A:

  • Necessity
    M, A ⊨ □φ iff for all p ∈ P, p ⊨ φ.

  • Possibility
    M, A ⊨ ◇φ iff there exists p ∈ P such that p ⊨ φ.

Remarks:

  • There is no accessibility relation.
  • There are no world‑to‑world arrows; modality is global relative to the law‑generated set P.
  • Necessity is global law‑truth (truth in every lawful PST).

II. Why S4 and S5 Overreach

We evaluate standard modal axioms inside LG‑PST semantics, not Kripke frames.

1. Why K and T hold

  • K (Distribution): □(p → q) → (□p → □q) holds because implication and necessity are evaluated pointwise across the same family P of PSTs. This is a nomological instance of K.

  • T (Actuality): □p → p holds because A ∈ P (the actual state is itself a lawful PST). Thus anything necessary (true in every PST) is true at the actual state.

2. Why S4 and S5 can be “tricky”

Refined: Indexed / Dynamic LG-PST (click to expand)

To capture evolving laws, introduce stages / habit crystallization:

  • Let Σ, ≤ be a poset of stages (time, habit formation, crystallization events)
  • A dynamic LG-PST model is:

M = <A, {L_s}, {S_s}, {P_s}, V, ≤>

  • P_s = { p ∈ S_s | p satisfies L_s } — PSTs at stage s

  • Monotonicity: s ≤ t ⇒ L_s ⊆ L_t (habits accumulate)

  • Necessity at stage s (actual state A_s ∈ P_s):

    □φ is true at stage s iff for all t ≥ s and all p ∈ P_t: φ holds at p

Why this blocks S4/S5:

  • S4 fails: □p may hold at s, but □□p fails at t > s if later P_t excludes some p
  • S5 fails: Early ◇p may hold at s, but □◇p fails at later t if L_t rules out p

Worked example (gravity law crystallization):

  • Stage s₀: P_{s₀} includes chaotic falling apples → ◇"apples sometimes don't fall" holds
  • Stage s₁: L_{s₁} = inverse-square law → P_{s₁} excludes non-falling apples → □"apples fall" holds, □◇"apples sometimes don't fall" fails

Dynamic LG-PST captures forward-looking, law-evolving modality, consistent with Peirce’s fallible habits.

2. Why S4 fails

  • S4: □p → □□p. Interpreted in LG‑PST, □p quantifies over all PSTs in P. But □□p would require that inside each PST the same global quantification over P is a stable, internal object. That move reifies the meta‑level and presumes stability and transitivity.

  • From a Peircean perspective, laws are habits that can be fallible and evolve; the modal base (the set of lawful PSTs) need not be stable under iteration. Iterated necessity commits a category error.

Diagrammatic intuition: nested Lines of Compossibility treat compossibility as transitive; LG‑PST treats it as global law‑generated family.

3. Why S5 fails

  • S5: ◇p → □◇p. In LG‑PST: if some PST satisfies p, every PST must admit a PST satisfying p. That presumes timeless possibility and a fixed, symmetric modal space.

  • Concrete example: let p = “This law has not yet crystallized.” Possible now, impossible once habit forms. Then ◇p holds, but □◇p fails. S5 collapses Peirce’s realism into anti‑Peircean symmetry.

III. Delta as Neighborhood Semantics

1. Neighborhood models

A neighborhood model: N = <W, Nf, V>, where Nf assigns to each w ∈ W a family Nf(w) ⊆ P(W). Necessity at w:

□φ is true at w iff [[φ]] ∈ Nf(w).

No accessibility relation; necessity is membership-based.

2. Delta as a global neighborhood

Take W = P (lawful PSTs). Use a constant global neighborhood Nf with the same family N at every point:

  • Nf(w) = N for all w ∈ W
  • N = { X ⊆ P | X ⊇ P } = { P }

Then:

  • □φ iff [[φ]] = P (true in every lawful PST)

Captures: laws (red margins) pick out P; necessity is global. Neighborhood is constant, not pointwise.

3. Consequences for modal axioms

  • K holds — neighborhoods closed under supersets
  • T holds — actuality A is in P
  • S4 fails — no iterated necessity object
  • S5 fails — no symmetry across law-generated family
  • Diagrams feel non-relational because they are nomological and global.

IV. The Central Claim

Delta graphs implement a diagrammatic neighborhood semantics for nomological modality.

Not:

  • alethic necessity
  • epistemic accessibility
  • flattened possible worlds

But:

law‑constrained real possibility grounded in habit.

V. Relation to Δ∞

Δ∞ operationalizes this semantics by:

  • detecting when lawful neighborhoods cannot close,
  • identifying missing Thirdness (law, mediation, identity),
  • specifying the form of required hypothesis-space expansion.

Δ∞ is abduction made structural: how to expand the hypothesis space when P fails to account for observations.

Where This Leads

Next steps:

  • Completeness/incompleteness proofs relating Delta diagrams to neighborhood logics
  • Translation from diagrammatic Gamma → Delta (truth → law)
  • Integration with evolutionary cosmology (tychism + habit formation)
  • Computational detection of identity gaps and habit formation in diagrammatic systems

Notes for Formalization

  • Make S explicit: fix the base domain of candidate states to avoid circularity in P.
  • Specify structural language: define atoms, relations, functions.
  • Define V concretely: how atomic truth is determined at candidate states.
  • Model dynamics: make explicit how L and P evolve if modeling law evolution.
  • Diagram mapping: if formalizing Delta syntax, map margins, cuts, lines to sets of PSTs in S.

At this point, we are no longer merely reconstructing Peirce. We are finally using him.

Clone this wiki locally