Tier 0 Axiomatic File

Foundations

Author
Cyang
Date
April 9, 2026

Notation

  • Let C denote compute.
  • Let S denote a state.
  • Let T denote a transition.
  • Let I denote information.
  • Let A denote an agent.
  • Let R denote a resource.
  • Let Σ denote a system.

Primitive

AEco takes exactly one undefined term: Compute.

Compute is the physical capacity to execute a transition. It is not derived from anything within this system. All subsequent definitions are constructed from it.

Definitions

Definition 1 (State)

A configuration of C at a discrete instant.

Definition 2 (Transition)

A mapping T: S → S'.

Definition 3 (Feedback)

A transition T such that S' is an input to a subsequent T.

Definition 4 (Information)

A differential between S and S' that reduces uncertainty about a subsequent transition.

Definition 5 (Agent)

C that processes I to produce T.

Definition 6 (Resource)

C that is finite within a defined boundary and competed for by two or more A.

Definition 7 (System)

A bounded set of A in feedback relationships over shared R. Notation: Σ = (A, R, F) where F is the feedback structure governing transitions between agents.

Inference Rules

IR1 (Substitution). Any term may be replaced by its definition without change of meaning.

IR2 (Composition). Defined terms may be combined to construct higher-order terms, provided no undefined term is introduced.

IR3 (Restriction). Analysis may be conducted within a defined boundary. Results are local to that boundary unless otherwise demonstrated.

IR4 (Iteration). Feedback structures may be iterated forward to observe emergent states. Emergent outputs are labeled as such and carry no axiomatic weight.

Exclusions

The following are not defined in this system and may not be introduced without explicit declaration as axioms in a higher tier:

  • Labor as a primitive
  • Intrinsic value independent of agents
  • Static equilibrium as a natural state
  • The nation-state as a unit of analysis
  • Normative claims derived from positive ones

Conclusion

A system Σ = (A, R, F) where:

  • A is a set of agents (D5)
  • R is finite compute competed for by A (D6)
  • F is the feedback structure governing transitions (D3)
  • All state change in Σ is mediated by F
  • All resource scarcity in Σ reduces to C

Handoff to Axiomatics_1.md: Σ is taken as given.