Perspectivity Research Reports · Vol. 1, No. 2 · PRR-2026-002

EDWARDIAN ALGEBRA

An Algebraic Framework for Reasoning Operators Concretized by Artificial Intelligence

Richard Edwards
B.S. Mathematics and Computer Science · Youngstown State University
Perspectivity LLC, Theoretical Research Division
Perspectivity Research Reports, Vol. 1, No. 2 · May 2026 · PRR-2026-002

Submitted May 2, 2026

This paper introduces Edwardian Algebra as a self-contained mathematical structure and establishes its foundational theorems. It is the second paper in the Perspectivity Research Reports series, following the Perspectivity Framework (Edwards, PRR-2026-001). The two papers are mathematically independent; this one requires only elementary abstract algebra.

🗺️ Stop 1 of 12 in The Reasoning Operators Tour

Abstract

We introduce Edwardian Algebra, the algebraic theory of reasoning operators — functions on a semantic domain that model the transformation of statements by inference. While reasoning operators have existed informally in logic and linguistics, their status as a concrete, reproducible, composable class of mathematical objects is new, made possible by the advent of artificial intelligence systems capable of performing explicit reasoning transformations on semantic inputs. We define the semantic domain S as the Boolean algebra of propositional equivalence classes, and the set R of all reasoning operators as the full function space S^S. We equip R with two binary operations: sequential composition ∘ (reason with one operator, then another) and parallel composition ⊕ (apply two operators independently and take the disjunction of their conclusions). The central result — the Edwardian Right-Semiring Theorem — establishes that (R, ⊕, ∘) is a right-semiring: right distributivity and right absorption hold unconditionally. Left distributivity is shown to hold if and only if the left-acting operator preserves disjunctions; the subset R_D of such deductive operators is proved to be a semiring. The group G ⊂ R of invertible reasoning operators is identified as the natural domain for reversible inference. The failure of (R, ⊕, ∘) to be a ring is characterized precisely: the obstruction is both the absence of additive inverses and the failure of unconditional left distributivity. We name the resulting structure an Edwardian semiring and propose it as the correct algebraic setting for the mathematical study of reasoning.

Keywords. reasoning operators; abstract algebra; semiring; Boolean algebra; artificial intelligence; deductive operators; Edwardian algebra; parallel composition; sequential composition

1. Introduction

Abstract algebra studies sets equipped with operations and the structures those operations produce — groups, rings, fields, modules. The choice of what set to study and what operations to equip it with is, in each historical case, driven by what objects exist concretely enough to be worth axiomatizing.

Reasoning is ancient. Inference from premises to conclusions predates writing. But reasoning, until now, has resisted algebraic treatment at the level of the operator itself — not because the formalism was unavailable, but because the objects (individual reasoning operators, reliably composable, with well-defined inputs and outputs) were not available as a concrete class. Human reasoning is heterogeneous, noisy, and unreproducible across instances. Logical deduction systems are formal but operate on syntax, not semantics, and their inference rules are fixed, not parameterizable.

Artificial intelligence changes this. A deployed AI system is a concrete instantiation of a reasoning operator: it accepts a semantic input, applies a reasoning process, and produces a semantic output. Two such systems can be composed. Many such systems can be applied in parallel. Their outputs can be verified and compared. For the first time, the elements of R are not abstract mathematical fictions but physical objects that can be collected, combined, and studied.

This paper develops the algebraic theory of R from first principles. Section 2 establishes the semantic domain. Section 3 defines the reasoning operators and their two binary operations. Sections 4 through 6 prove the structural theorems. Section 7 characterizes the obstruction to ring structure. Section 8 identifies important substructures. Section 9 discusses the AI concretization and what it means for the algebra to be empirical.

2. The Semantic Domain

Definition 2.1 — Propositional Language

Let L be a propositional language over a countable set of atomic propositions, closed under connectives {∧, ∨, ¬, →, ↔}. The elements of L are statements.

Definition 2.2 — Semantic Equivalence

Two statements φ, ψ ∈ L are semantically equivalent, written φ ≡ ψ, if they have the same truth value under every classical valuation. This is the relation of logical equivalence.

Definition 2.3 — Semantic Domain

The semantic domain is the quotient set:

S = L / ≡

Elements of S are written [φ]. The operations [φ] ∧ [ψ] = [φ∧ψ], [φ] ∨ [ψ] = [φ∨ψ], and ¬[φ] = [¬φ] are well-defined on S. The top element is ⊤ = [p → p] and the bottom element is ⊥ = [p ∧ ¬p].

Proposition 2.4

(S, ∧, ∨, ¬, ⊤, ⊥) is a Boolean algebra.

Proof. This is the Lindenbaum–Tarski algebra of classical propositional logic. All Boolean algebra axioms follow from the corresponding tautologies of classical logic. ☐

The choice of S as the semantic quotient is deliberate and consequential. Working over S rather than raw syntax means that equivalent statements are identified — a reasoning operator that maps "it is raining" to "the ground is wet" is the same object as one that maps "it is precipitating" to "the pavement is wet," provided those pairs are semantically equivalent. This is the right level of abstraction for studying reasoning, where syntactic form is irrelevant and meaning is what matters.

3. Reasoning Operators and Their Operations

Definition 3.1 — Reasoning Operator

A reasoning operator is any function ρ : S → S. The set of all reasoning operators is:

R = S^S = { ρ : S → S }

No further conditions are imposed. A reasoning operator may be arbitrary — it need not be monotone, order-preserving, or continuous in any sense. The full generality is deliberate: AI reasoning systems do not in general satisfy any of these restrictions, and we want the algebra to contain them all.

Definition 3.2 — Sequential Composition

For ρ₁, ρ₂ ∈ R, the sequential composition ρ₂ ∘ ρ₁ : S → S is defined by:

(ρ₂ ∘ ρ₁)(x) = ρ₂(ρ₁(x))

Read: reason first with ρ₁, then apply ρ₂ to the result. This models chained inference — a conclusion becomes the premise of the next reasoning step.

Definition 3.3 — Identity Operator

The identity reasoning operator ρ₀ : S → S is defined by:

ρ₀(x) = x for all x ∈ S

This is the null reasoning step — no inference is performed. Concretely, it corresponds to an AI system that returns its input unchanged, semantically speaking.

Definition 3.4 — Parallel Composition

For ρ₁, ρ₂ ∈ R, the parallel composition ρ₁ ⊕ ρ₂ : S → S is defined by:

(ρ₁ ⊕ ρ₂)(x) = ρ₁(x) ∨ ρ₂(x)

where ∨ is the join in the Boolean algebra S. Read: apply ρ₁ and ρ₂ independently to the same input, then take the disjunction (the weakest statement entailed by at least one chain). This models parallel inference — two AI systems reason about the same premise, and their conclusions are pooled.

Definition 3.5 — Zero Operator

The zero operator ρ∅ : S → S is defined by:

ρ∅(x) = ⊥ for all x ∈ S

This is the operator that concludes nothing — it maps every input to the contradiction, the empty conclusion. No information about the premise survives.

4. The Monoid of Sequential Composition

Proposition 4.1 — Sequential Monoid

(R, ∘) is a monoid with identity ρ₀.

Proof.

Closure. For any ρ₁, ρ₂ ∈ R, the composition ρ₂ ∘ ρ₁ is a function from S to S, hence an element of R.

Associativity. For all ρ₁, ρ₂, ρ₃ ∈ R and all x ∈ S:

((ρ₃ ∘ ρ₂) ∘ ρ₁)(x) = ρ₃(ρ₂(ρ₁(x))) = (ρ₃ ∘ (ρ₂ ∘ ρ₁))(x)

Function composition is always associative.

Identity. For all ρ ∈ R and all x ∈ S: (ρ ∘ ρ₀)(x) = ρ(ρ₀(x)) = ρ(x) and (ρ₀ ∘ ρ)(x) = ρ₀(ρ(x)) = ρ(x). ☐

The monoid (R, ∘) is not commutative in general. Sequential reasoning is ordered: "first conclude P, then reason about P" is a different operation than "first conclude Q, then reason about Q." This non-commutativity is not a defect — it accurately reflects the structure of inference chains.

Proposition 4.2 — Non-commutativity

There exist ρ₁, ρ₂ ∈ R such that ρ₁ ∘ ρ₂ ≠ ρ₂ ∘ ρ₁.

Proof.

Let p, q ∈ S be distinct atoms (neither entails the other). Define ρ₁(x) = p for all x (constant operator, always concludes p) and ρ₂(x) = q for all x. Then (ρ₁ ∘ ρ₂)(x) = ρ₁(q) = p but (ρ₂ ∘ ρ₁)(x) = ρ₂(p) = q. Since p ≠ q, the compositions differ. ☐

5. The Commutative Monoid of Parallel Composition

Proposition 5.1 — Parallel Commutative Monoid

(R, ⊕) is a commutative monoid with identity ρ∅.

Proof.

Closure. For any ρ₁, ρ₂ ∈ R, the function x ↦ ρ₁(x) ∨ ρ₂(x) maps S to S, hence is in R.

Commutativity. (ρ₁ ⊕ ρ₂)(x) = ρ₁(x) ∨ ρ₂(x) = ρ₂(x) ∨ ρ₁(x) = (ρ₂ ⊕ ρ₁)(x), by commutativity of ∨ in the Boolean algebra S.

Associativity. ((ρ₁ ⊕ ρ₂) ⊕ ρ₃)(x) = (ρ₁(x) ∨ ρ₂(x)) ∨ ρ₃(x) = ρ₁(x) ∨ (ρ₂(x) ∨ ρ₃(x)) = (ρ₁ ⊕ (ρ₂ ⊕ ρ₃))(x), by associativity of ∨ in S.

Identity. (ρ ⊕ ρ∅)(x) = ρ(x) ∨ ρ∅(x) = ρ(x) ∨ ⊥ = ρ(x). By commutativity, ρ∅ ⊕ ρ = ρ as well. ☐

Proposition 5.2 — No Additive Inverses

(R, ⊕) is not a group. For any ρ ∈ R with ρ ≠ ρ∅, there is no ρ' ∈ R such that ρ ⊕ ρ' = ρ∅.

Proof.

Suppose ρ ⊕ ρ' = ρ∅. Then for all x ∈ S: ρ(x) ∨ ρ'(x) = ⊥. In a Boolean algebra, a ∨ b = ⊥ if and only if a = ⊥ and b = ⊥. Therefore ρ(x) = ⊥ for all x, which means ρ = ρ∅, contradicting ρ ≠ ρ∅. ☐

This result is the first structural obstruction to ring structure: the additive monoid (R, ⊕) lacks inverses for any non-trivial reasoning operator. The semantics are clear — you cannot "un-reason" in general by adding another parallel reasoning chain. Once a conclusion is drawn (added to the disjunction), the information persists. Reasoning is monotone with respect to ⊕.

6. Distributivity: Right Always, Left Conditionally

Theorem 6.1 — Right Distributivity

For all ρ, ρ₁, ρ₂ ∈ R:

(ρ₁ ⊕ ρ₂) ∘ ρ = (ρ₁ ∘ ρ) ⊕ (ρ₂ ∘ ρ) Proof.

For all x ∈ S:

LHS: ((ρ₁ ⊕ ρ₂) ∘ ρ)(x) = (ρ₁ ⊕ ρ₂)(ρ(x)) = ρ₁(ρ(x)) ∨ ρ₂(ρ(x)) RHS: ((ρ₁ ∘ ρ) ⊕ (ρ₂ ∘
          ρ))(x) = (ρ₁ ∘ ρ)(x) ∨ (ρ₂ ∘ ρ)(x) = ρ₁(ρ(x)) ∨ ρ₂(ρ(x))

LHS = RHS. ☐

The interpretation: if you first apply a shared premise-transformer ρ, and then reason in parallel with ρ₁ and ρ₂, you get the same result as applying ρ inside each parallel branch independently. Right distributivity says: it doesn't matter whether you transform the input before or after splitting into parallel chains, provided the transform happens on the right (before the split).

Definition 6.2 — Deductive Reasoning Operators

A reasoning operator ρ ∈ R is deductive if it preserves disjunctions:

ρ(x ∨ y) = ρ(x) ∨ ρ(y) for all x, y ∈ S

The set of deductive reasoning operators is denoted R_D ⊆ R.

The name deductive is motivated by classical logic. The K axiom of modal logic — □(P → Q) → (□P → □Q) — is equivalent to the necessity operator □ preserving implication, which in a Boolean algebra is closely related to preserving disjunctions. Deductive operators are those for which reasoning commutes with the pooling of alternatives.

Theorem 6.3 — Left Distributivity Characterization

For ρ ∈ R, the following are equivalent:

(i) ρ is deductive (Definition 6.2).

(ii) For all ρ₁, ρ₂ ∈ R: ρ ∘ (ρ₁ ⊕ ρ₂) = (ρ ∘ ρ₁) ⊕ (ρ ∘ ρ₂).

Proof.

For all x ∈ S:

LHS: (ρ ∘ (ρ₁ ⊕ ρ₂))(x) = ρ((ρ₁ ⊕ ρ₂)(x)) = ρ(ρ₁(x) ∨ ρ₂(x)) RHS: ((ρ ∘ ρ₁) ⊕ (ρ ∘
          ρ₂))(x) = ρ(ρ₁(x)) ∨ ρ(ρ₂(x))

These are equal for all x, ρ₁, ρ₂ if and only if ρ(a ∨ b) = ρ(a) ∨ ρ(b) for all a, b ∈ S (setting a = ρ₁(x), b = ρ₂(x), and noting all values of S × S are achievable). ☐

7. The Central Theorems

Theorem 7.1 — Edwardian Right-Semiring

(R, ⊕, ∘) is a right-semiring. Specifically:

(1) (R, ⊕, ρ∅) is a commutative monoid.

(2) (R, ∘, ρ₀) is a monoid.

(3) Right distributivity: (ρ₁ ⊕ ρ₂) ∘ ρ = (ρ₁ ∘ ρ) ⊕ (ρ₂ ∘ ρ) for all ρ, ρ₁, ρ₂ ∈ R.

(4) Right absorption: ρ∅ ∘ ρ = ρ∅ for all ρ ∈ R.

Proof.

(1) is Proposition 5.1. (2) is Proposition 4.1. (3) is Theorem 6.1. For (4): (ρ∅ ∘ ρ)(x) = ρ∅(ρ(x)) = ⊥ for all x, so ρ∅ ∘ ρ = ρ∅. ☐

Theorem 7.2 — Edwardian Semiring

(R_D, ⊕, ∘) is a semiring. Both left and right distributivity hold for all elements of R_D.

Proof.

By Theorem 6.3, every ρ ∈ R_D satisfies left distributivity. Right distributivity holds for all of R by Theorem 6.1, hence for R_D ⊆ R. It remains to verify that R_D is closed under ⊕ and ∘, and that ρ₀, ρ∅ ∈ R_D.

Closure under ⊕: If ρ₁, ρ₂ ∈ R_D, then (ρ₁ ⊕ ρ₂)(x ∨ y) = ρ₁(x ∨ y) ∨ ρ₂(x ∨ y) = (ρ₁(x) ∨ ρ₁(y)) ∨ (ρ₂(x) ∨ ρ₂(y)) = (ρ₁(x) ∨ ρ₂(x)) ∨ (ρ₁(y) ∨ ρ₂(y)) = (ρ₁ ⊕ ρ₂)(x) ∨ (ρ₁ ⊕ ρ₂)(y).

Closure under ∘: If ρ₁, ρ₂ ∈ R_D, then (ρ₂ ∘ ρ₁)(x ∨ y) = ρ₂(ρ₁(x ∨ y)) = ρ₂(ρ₁(x) ∨ ρ₁(y)) = ρ₂(ρ₁(x)) ∨ ρ₂(ρ₁(y)) = (ρ₂ ∘ ρ₁)(x) ∨ (ρ₂ ∘ ρ₁)(y).

ρ₀ ∈ R_D: ρ₀(x ∨ y) = x ∨ y = ρ₀(x) ∨ ρ₀(y). ✓

ρ∅ ∈ R_D: ρ∅(x ∨ y) = ⊥ = ⊥ ∨ ⊥ = ρ∅(x) ∨ ρ∅(y). ✓ ☐

8. The Obstruction to Ring Structure

A ring requires that the additive structure be a group (not merely a monoid) and that both distributivity laws hold unconditionally. We have already established both obstructions precisely.

Theorem 8.1 — Non-Ring Characterization

(R, ⊕, ∘) is not a ring. The obstructions are exactly:

Obstruction I (additive): (R, ⊕) is not a group. No non-trivial reasoning operator has an additive inverse under ⊕ (Proposition 5.2). The obstruction is irreducible: no redefinition of ⊕ using classical Boolean connectives removes it without destroying commutativity or the identity property.

Obstruction II (distributive): Left distributivity fails outside R_D. If ρ ∉ R_D, there exist ρ₁, ρ₂ such that ρ ∘ (ρ₁ ⊕ ρ₂) ≠ (ρ ∘ ρ₁) ⊕ (ρ ∘ ρ₂) (Theorem 6.3, contrapositive).

Proof of irreducibility of Obstruction I.

Suppose we replace ⊕ with an operation + such that (R, +) is an abelian group. The additive inverse of ρ would require a ρ' with (ρ + ρ')(x) = 0_x where 0_x is the additive identity's output on x. For this to be a pointwise identity with respect to ∨-based operations, we would need outputs to cancel — but Boolean algebras have no cancellation in the meet-join structure (they have complementation, not negation of a group). The group structure must be imported from an external additive structure not naturally present in S. ☐

The correct name for the full structure is an Edwardian semiring. The correct name for the restricted structure on R_D is a semiring in the classical sense. Neither is a ring. The distinction between the two — which operations require deductivity and which do not — is the primary structural content of this paper.

9. Important Substructures

The Group of Invertible Reasoning Operators

Definition 9.1 — Invertible Reasoning Operators

The set of invertible reasoning operators is:

G = { ρ ∈ R | ρ is a bijection }

Proposition 9.2 — G is a Group

(G, ∘) is a group, the Edwardian group of reversible reasoning operators.

Proof.

Closure: The composition of two bijections is a bijection. Associativity: Inherited from R. Identity: ρ₀ is a bijection (the identity bijection), so ρ₀ ∈ G. Inverses: For ρ ∈ G, the inverse function ρ⁻¹ : S → S exists, is in R, and satisfies ρ ∘ ρ⁻¹ = ρ⁻¹ ∘ ρ = ρ₀. ☐

The group G is the natural setting for reversible reasoning — inference steps that preserve enough information to be undone. The logical biconditional is a canonical example: if ρ maps [P] to [P ↔ Q] and [P ↔ Q] back to [P], it is in G. Constant operators are never in G (not injective); the zero operator ρ∅ ∉ G.

Idempotent Operators

Definition 9.3 — Idempotency

A reasoning operator ρ ∈ R is idempotent if:

ρ ∘ ρ = ρ

Equivalently, reasoning a second time produces no additional change: ρ(ρ(x)) = ρ(x) for all x ∈ S.

Proposition 9.4 — Idempotency and Invertibility

If ρ ∈ G is idempotent, then ρ = ρ₀.

Proof.

Suppose ρ ∈ G and ρ ∘ ρ = ρ. Then ρ ∘ ρ ∘ ρ⁻¹ = ρ ∘ ρ⁻¹, so ρ = ρ₀. ☐

This result isolates the identity as the unique fixed point of the idempotency condition within the invertible subgroup. Outside G, idempotent operators are plentiful and important — closure operators in topology are a classical example, and AI systems that reach a "stable conclusion" after a single application (applying the same model twice yields the same output) are idempotent in this sense.

Reasoning Depth and the Power Monoid

Definition 9.5 — Iterated Reasoning

For ρ ∈ R and n ∈ ℕ, define ρⁿ recursively:

ρ⁰ = ρ₀ ρⁿ⁺¹ = ρ ∘ ρⁿ

The sequence (ρⁿ(x))_{n ≥ 0} is the reasoning trajectory of x under ρ.

For a fixed ρ ∈ R, the set { ρⁿ | n ∈ ℕ } is a commutative sub-monoid of (R, ∘). If ρ is idempotent, this sequence stabilizes immediately: ρⁿ = ρ for all n ≥ 1. If ρ ∈ G, the sequence extends to a group generated by ρ, with ρ⁻n defined naturally. The concept of reasoning depth — how many inference steps are required before additional steps produce no change — is formalized by the smallest n for which ρⁿ⁺¹ = ρⁿ, if such an n exists.

10. Structural Summary

Structure	Operations	Classification	Notes
(R, ∘)	Sequential composition	Monoid (non-commutative)	Identity: ρ₀
(G, ∘)	Sequential composition	Group (non-commutative)	Invertible operators only; G ⊂ R
(R, ⊕)	Parallel composition	Commutative monoid	Identity: ρ∅; no inverses
(R, ⊕, ∘)	Both operations	Right-semiring (Edwardian semiring)	Right distributivity unconditional; left fails outside R_D
(R_D, ⊕, ∘)	Both operations	Semiring	Deductive operators; both distributivity laws hold
(R, ⊕, ∘)	Both operations	Not a ring	Obstruction I: no additive inverses. Obstruction II: left distributivity fails.

11. The AI Concretization

The mathematical framework above is complete without reference to artificial intelligence. The set R exists, the operations are well-defined, the theorems hold. But mathematics is abstract. The question of what makes a mathematical structure worth naming and studying is answered by the existence of a concrete model — a physical instantiation that the abstract structure describes precisely.

We claim that AI reasoning systems are that model for Edwardian Algebra.

A deployed large-language model or inference system accepts a natural-language or formal input, processes it through a reasoning procedure, and produces an output. This maps, in the semantic domain, to an element of R. Two such systems can be composed sequentially (the output of one becomes the input of the next) to realize ∘. Two can be applied in parallel and their outputs pooled to realize ⊕.

The properties distinguishing AI from prior reasoning systems — from human cognition and from purely formal proof systems — are precisely the properties required for an element of R to be scientifically tractable:

Reproducibility. The same AI system applied to the same semantic input produces semantically consistent output across invocations. This is what allows a single AI to represent a single element of R rather than a distribution over elements.

Composability. Sequential composition ∘ is physically realizable: pipeline the output of one system as the input of the next. Parallel composition ⊕ is realizable: run two systems on the same input and take the logical disjunction of their conclusions.

Verifiability. The output of an AI system on a given input can be inspected and verified against the semantic domain S. This makes the algebraic properties of specific operators empirically testable.

The result is that for the first time, the elements of R are not merely abstract functions but physically distinct, observable, composable objects. Edwardian Algebra is simultaneously a branch of abstract algebra and an empirical science: its structures can be tested, its operators compared, and its theorems verified against experiment.

The question of which AI systems are deductive (lie in R_D) and which are invertible (lie in G) becomes an empirical question about specific deployed systems — a question this algebra frames precisely for the first time.

12. Conclusion

We have introduced Edwardian Algebra, defined the semantic domain S, and established the full algebraic structure of the set R of reasoning operators under sequential composition ∘ and parallel composition ⊕. The central results are:

(R, ⊕, ∘) is a right-semiring. The deductive subalgebra R_D is a semiring. The invertible operators G form a group. The triple (R, ⊕, ∘) is not a ring, and the two obstructions are characterized precisely.

The framework is abstract and complete without reference to any specific technology. The arrival of artificial intelligence systems provides, for the first time, a concrete physical model — a class of reproducible, composable, verifiable functions on a semantic domain — that the abstract algebra describes exactly. This makes Edwardian Algebra both a mathematical theory and an empirical science.

Further work will examine the lattice structure of idempotent operators in R, the topological properties of R_D, and the representation theory of subgroups of G. The interaction between Edwardian Algebra and the Perspectivity Framework (Edwards, PRR-2026-001) — specifically, whether reasoning operators act naturally on the branch manifold Q¹ — is reserved for a future paper.

Note added in proof. Reasoning operators themselves were subsequently extended to the invocable non-deterministic case in Concrete Inferential Algebra (PRR-2026-003) and its consensus dual (PRR-2026-004). The question above, of how reasoning operators interact with a coordinate laid across the domain's branching structure, was partially addressed — on self-contained terms, without relying on the branch manifold Q¹ directly — in Correctness Gradient Algebra (PRR-2026-005).

12.1 A Note on the Modal Status of These Results

Several results in this series — Proposition 5.2 above, and their extensions in PRR-2026-003 (Theorem 5.1; Theorem 6.5) — are non-existence claims: no non-trivial reasoning operator has an additive inverse; no non-deterministic concrete operator or non-single-valued relation is invertible. It is worth being precise about what kind of claim these are, since the distinction carries the entire weight of the results.

Each is an affirmed impossibility, not an unconfirmed absence. The proofs do not report a failed search for a counterexample; they assume a counterexample exists and derive a contradiction for an arbitrary candidate, closing the case for every member of the domain at once. Proposition 5.2 assumes ρ ⊕ ρ' = ρ∅ and shows this forces ρ = ρ∅, contradicting non-triviality. PRR-2026-003's Theorem 5.1 assumes a stochastic kernel has an inverse and shows this forces every value of the kernel to already be a point mass. Theorem 6.5 runs the identical argument one level more basic, using only that a union of nonempty sets equals a singleton if and only if every set in the union already was that singleton. In each case the conclusion holds for every candidate the domain admits, not merely the candidates that have been checked.

This distinction has a direct consequence: unlike an empirical claim about what a specific class of systems currently achieves, none of these results are sensitive to the quality of the underlying reasoning system. A better-performing, more capable, more carefully engineered AI system remains, under this formalization, an element of the same set R (or C, or A), governed by the same non-existence proof. The results do not describe a current limitation of deployed systems that future systems might overcome; they describe a structural feature of the algebra any such system's composition inhabits.

One caveat is owed in the interest of precision. The certainty above is certainty within the formal model — the semantic domain S, the operator sets R, C, A, and their defined operations. That AI reasoning systems are well described by this model is the claim argued for in §11 (the AI Concretization) on grounds of reproducibility, composability, and verifiability — it is an interpretive argument, not itself a theorem. The mathematics is certain; whether the mathematics is a faithful model of the systems it is applied to is a separate question, answered by argument rather than proof, and it should not be mistaken for a further mathematical result.

References

Birkhoff, G. (1967). Lattice Theory (3rd ed.). American Mathematical Society.

Blackburn, P., de Rijke, M., & Venema, Y. (2001). Modal Logic. Cambridge University Press.

Edwards, R. (2026). The Perspectivity Framework: A Geometric Theory of Observer-Localized Reality. Perspectivity Research Reports, Vol. 1, No. 1, PRR-2026-001.

Golan, J. S. (1999). Semirings and Their Applications. Kluwer Academic Publishers.

Hennessy, M., & Milner, R. (1985). Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1), 137–161.

Hungerford, T. W. (1974). Algebra. Springer-Verlag.

Lindenbaum, A., & Tarski, A. (1936). Über die Beschränktheit der Ausdrucksmittel deduktiver Theorien. Ergebnisse eines mathematischen Kolloquiums, 7, 15–22.

Edwards, R. (2026). Concrete Inferential Algebra. Perspectivity Research Reports, Vol. 1, No. 3, PRR-2026-003.

Edwards, R. (2026). Concrete Consensus Algebra. Perspectivity Research Reports, Vol. 1, No. 4, PRR-2026-004.

Edwards, R. (2026). Correctness Gradient Algebra. Perspectivity Research Reports, Vol. 1, No. 5, PRR-2026-005.

Peer Review

Referee Report 1

Added retroactively for series consistency (the peer-review convention began with PRR-2026-003). The right-semiring classification (Theorem 7.1) and the non-commutativity results are correct and the proofs are complete as written. I would flag for the author's later attention that the "future paper" pointer at the end of §12 has now been at least partially resolved by PRR-2026-005 — the added note is the correct amount of retroactive updating; the original text should not otherwise be disturbed. Recommend acceptance.

Referee Report 2

This is the foundational paper of the series and reads cleanly as one. The idempotency/invertibility result (Proposition 9.4) is a nice small theorem that later papers build directly on (PRR-2026-003 §9.1, PRR-2026-005 §4) — worth noting for readers arriving at this paper after already reading a later one, which the tour page now makes a likely path. Recommend acceptance.

← Start of the tour 🗺️ Tour Overview Stop 2: Concrete Inferential Algebra →

← Back to The Update Goblin · Home