Appendix: Logical Foundations of the Exentation Chain

This appendix presents the formal treatment of ArXe’s foundational contradiction and its resolution of the classical objections associated with systems built on a contradiction. Definitions and results are presented here; the development that led to them is documented separately.

1. Two negators, not one

The symbol ¬ covers, in ordinary use, two distinct operations that ArXe separates explicitly:

Term negation (¬S): applied to a term reducible to a single name (an atom, or a compound name with no unreduced internal connectives). This is the operation behind what Aristotle called an indefinite name (ónoma aóriston, On Interpretation, ch. 2 and 10): “not-man” is a new name, not the negation of a proposition. This negation carries no temporal cost.
Exentation (¬(...)): applied to a genuinely compound expression (containing an unreduced ∧ or ∨). This is the operation that actually generates the theory’s chain of levels, and it carries a temporal cost of 1 Tf per application.

General rule: ¬X costs 1 Tf if and only if X is not reducible to a term.

2. Essence and existence

Essence rule: everything reducible to a term has essence, as long as it is not explicitly negated. “Fuchsiahorse”, “unfuchsiahorse” have essence (positive names); “not-fuchsiahorse” does not (explicit negation).

Essence/existence relation: existence implies essence; essence does not imply existence. The foundational contradiction (Ent₁) has essence, but neither existence nor truth.

Scope of essence: essence is determined by the surface form of the term, not by the content that term abbreviates. Consequence: essence neither restricts nor licenses any inference — it is a condition of reference (it allows naming Ent₁ without committing to its existence), not a logical condition with deductive consequences.

3. Temporal threshold semantics

3.1 Motivation

Instead of assigning each formula a classical truth value available immediately, each formula is assigned a minimum temporal threshold τ(X): the number of Tf units required before X can be evaluated at all. Before t = τ(X), the state of X is undefined — neither true nor false, unavailable to any inference rule.

3.2 Rules

τ(S) = 0                              (atomic term)
τ(¬X) = τ(X)         if X is reducible to a term
τ(¬X) = τ(X) + 1      if X is not reducible to a term (exentation)
τ(X ∧ Y) = τ(X) + τ(Y)
τ(X ∨ Y) = τ(X) + τ(Y) − 1

The ∨ rule is not a free choice: it is the only one that preserves, in threshold terms and not merely in truth-value terms, the De Morgan identity the theory itself declares between ¬(X∧Y) and ¬X∨¬Y.

3.3 The three states

t < τ(X)   →   X is undefined
t ≥ τ(X)   →   X takes its classical value (true or false), depending on its structure

4. The self-similarity theorem

Since ExEntₙ₋₁ ≡ ¬(Entₙ₋₁) (an identity of formulas, not merely of value), it follows that:

Entₙ = Entₙ₋₁ ∧ ¬(Entₙ₋₁)

The entire hierarchy is the same foundational operation (X∧¬X), applied recursively, taking the entire previous level as the new term. This is fractal self-similarity in a literal, algebraic sense — not a metaphor.

Verified result: the number of literals (occurrences of terms, positive or negated) in the fully expanded form of Entₙ is exactly 2ⁿ. This anchors the notion of “n-ary logic” to a precise, verifiable syntactic count, rather than a qualitative characterization.

5. Classical objections and their resolution

Objection	Resolution in ArXe
Russell — “the existent round square” forces a contradiction via unrestricted property comprehension.	Declarative existence and truth do not count as real existence or truth. A term including “existent” in its description does not thereby exist.
Meinong’s jungle — uncontrolled proliferation of objects with essence.	There is no comprehension over arbitrary sets of properties: a single generator (`¬()`) unfolds the entire hierarchy; no objects are freely postulated.
Logical explosion (Lewis) — from a contradiction, any proposition follows, via chained ∧-elimination, ∨-introduction, and disjunctive syllogism.	∧-elimination on `Entₙ` presupposes that `Entₙ` is already evaluable. Under the threshold semantics, `Entₙ` is undefined until `t=τ(Entₙ)`; there are no loose formulas available to start Lewis’s chain before that point.

6. Development status

Stable and verified: the definitions in §1–§4, the preservation of De Morgan under the threshold semantics, the self-similarity theorem, and its combinatorial verification (2ⁿ).

Still under development, not to be treated as closed:

A general proof that no other combination of rules — beyond the specific Lewis route blocked in §3 — allows triviality to be derived at any level of the hierarchy.
A complete formalization of the three-state semantics (undefined/true/false) as an explicit truth-table system.
The precise relation between “actual” (as a proper name for the foundational event) and the Principle of Non-Contradiction, and its individuation condition relative to other logical or mathematical contradictions.