Spherepop

Formal Logic

Recursive Containment and Deferred Closure

• Cognitive Topology — Notes

• The Geometry of Nested Mental Bubbles — Audio Overview

Geometry, Cognition, and the Transparency of Computation

• The Geometry of Computation — Notes

• How Nested Bubbles Fix Flat Math — Audio Overview

---

Music

Implementation in C

---

History as Identity

Structured Irreversibility

Spherepop is an event-driven, visual and formal framework for building meaning, computation, and structure through irreversible actions.

Instead of starting from sets, states, or representations, Spherepop starts from events: things that happen once, change what is possible next, and leave an auditable history behind.

At its core, Spherepop replaces static foundations with a constructive, history-based mereology (part–whole relations built over time).

Play the Spellpop mini-game

Spherepop Game Engine — Playable Demo

---

What Spherepop Is

Spherepop is simultaneously:

• a formal calculus for event-sourced structure,
• a visual programming model based on nested scopes (“bubbles”),
• and a foundational alternative to set-theoretic thinking.

Meaning, identity, and computation arise from what has been done, not from timeless axioms.

---

Core Ideas (Short Version)

1. Events before objects

Nothing exists by assumption. Objects, relations, and identities exist only if introduced by events.

2. Part–whole instead of membership

Spherepop replaces set membership (∈) with a time-indexed part-of relation, built incrementally from events.

3. Event-sourced semantics

All structure arises from a replayable log of irreversible operations:

• Pop — eliminate an option by resolving it
• Refuse — exclude an option by commitment
• Bind — impose dependency without elimination
• Collapse — identify distinctions to simplify history
• Meld — synthesize parallel histories into one future

Existence is historical, not axiomatic.

4. Identity is historical

Two things are the same if they have the same event history.
There is no notion of identity independent of construction.

5. No classical paradoxes

Russell-style paradoxes cannot arise because Spherepop has:

• no global membership relation,
• no unrestricted comprehension,
• no predicate-generated objects.

If something exists, you can point to the event that made it.

6. Scales with reality, not hypotheticals

Spherepop replaces power sets and hypothetical infinity with linear event logs.
Complexity grows with what actually happens, not with what could have happened.

---

Spherepop as a Visual Language

Spherepop also exists as an interactive visual system.

• Expressions are drawn as nested bubbles (scopes).
• Each bubble represents a local context or subexpression.
• Popping a bubble explicitly evaluates that scope.
• Computation proceeds by deliberate traversal, not automation.

This makes scope, order of evaluation, and dependency visible.

---

Why This Matters

Spherepop is motivated by a simple observation:

Real systems—cognitive, computational, social—are not defined by states.
They are defined by irreversible history.

By making commitment, exclusion, synthesis, and abstraction explicit, Spherepop provides:

• a clearer model of computation,
• a more faithful account of agency,
• and a foundation aligned with how real systems evolve.

---

Learn More

• The History of Spherepop

• Operational Mereology via Event-Sourced Semantics

• The Joy of Spherepop

• The Architecture of Meaning

• Platform Dynamics

• Demos and visuals:
  See the animations and screenshots in this repository for interactive examples of nested scopes, popping, and collapse.

---

░▒▓ SPHEREPOP AT A GLANCE ▓▒░

Traditional                 Spherepop
─────────────────────────────────────────────────────
State                  →    History
Context Γ              →    Ordered Event History H
Assignment             →    Constructive Event
Mutation               →    Monotone Growth
Delete                 →    Refuse
Equality               →    Collapse
Substitution           →    Historical Substitution
Function               →    History Transformer
Type                   →    Refusal Structure
Proof                  →    Replayable History
Compilation            →    History Construction
Verification           →    Deterministic Replay
Concurrency            →    Meld Compatible Histories

The Five Primitive Operations

            ○ Pop
             │
             ▼
        Choose History
             │
      ┌──────┴──────┐
      ▼             ▼
 Refuse ✕      Bind ○──────► Dependency
      │
      ▼
 Collapse ◎────► Equivalent Histories
      │
      ▼
 Meld ⊕───────► Unified History

Historical Type Theory

Traditional

Γ ⊢ t : A

Static assumptions
        │
        ▼
Type checking


Spherepop

H ⊢ t : A

Historical replay
        │
        ▼
Admissible continuation
        │
        ▼
Extended history

Types are Refusal Structures

Candidate Continuation

        │
        ▼

   ┌──────────────┐
   │ Refusal Type │
   └──────────────┘

      │     │     │
      │     │     │
      ▼     ▼     ▼

   Admit  Defer  Refuse
     │              │
     ▼              ▼

 Continue      Stop History

Historical Identity

History A ─────────────┐
                       │
                       ▼
                  Collapse
                       ▲
                       │
History B ─────────────┘

Equality is discovered,
not assumed.

The Kernel

Parse
  │
  ▼
Elaborate
  │
  ▼
Replay
  │
  ▼
Normalize
  │
  ▼
Verify
  │
  ▼
Commit

---

Programs  = Histories

Types     = Refusal Structures

Proofs    = Replayable Histories

Functions = History Transformers

Computation = Admissible Growth

Truth = Verified Construction

Spherepop: Computation is not the transformation of state, but the irreversible growth of an admissible history.