Endnote on Metaphysics and Metaphysical Closure

 1. Letdown

Intuitively, we all recognize that to ascribe to a closed metaphysical system is to accept that some agent—some thinker, some architect—has claimed the authority to describe the entire universe in principle. Every such system carries this hidden assertion: that the conceptual resources chosen by its author are not only adequate for the world, but adequate for all possible worlds, all possible questions, all possible futures of inquiry. This is the point at which my disappointment begins.

Metaphysics, at its best, is the attempt to understand what there is and how it hangs together. It is a human activity born of curiosity, wonder, and the desire for orientation. But again and again, metaphysics has drifted toward totality: toward the dream of a final account, a complete structure, a theory that leaves nothing outside its frame. The ambition is understandable; the confidence is not.

This endnote is at last motivated by the tension between those two impulses—the legitimate desire for understanding and the unwarranted leap to closure. My aim is not to dismantle metaphysics and never was, but to expose the limits that any finite agent must face when attempting to survey the whole. The impossibility of closure is not a failure of imagination; it is a recognition of our position. And this endnote is about that recognition, and the disappointment that accompanies it.

2. Framework

The idea for this endnote emerged from a strange corner of computer science. There exists a small, mischievous phenomenon—playfully called the reply‑bomb subject‑inflation hack—which I will refer to more soberly as the recursive‑subject email loop. In it, each reply generates a new subject line, which in turn triggers another reply, and so on, producing an ever‑expanding chain that no single step anticipated. My final motivation for explaining metaphysical systems springs from this structure. I call the analogue, just to name it, the recursive‑propositional‑domain loop: the thought that every attempt to articulate a complete metaphysical domain inevitably generates new propositions that outstrip the system meant to contain them. This endnote begins from that structural echo and the limits it reveals.

Given this, my framework isolates two fundamental capacities that every finite agent possesses: the ability to formulate propositions and the ability to justify them. These capacities behave differently, and the asymmetry between them drives the impossibility result that follows.

Formulation. To formulate a proposition is to express it conceptually as something that could be true or false. Formulation is open‑ended: an agent may always introduce a new proposition into consideration.

Justification. To justify a proposition is to present it as something that must be true or false. Unlike formulation, justification is constrained by the finite procedures available to the agent.

Finite Agent. A finite agent, A is one whose justificatory operations are governed by a determinate, finitary method. The agent’s justificatory resources are fixed, even though its capacity to formulate new propositions is not. The justificatory device is fixed in the sense that its method cannot expand in response to the propositions it is applied to.

Propositional Domain. The propositional domain, P of an agent is the total collection of propositions the agent could, in principle, formulate. Any proposition the agent actually formulates automatically belongs to this domain. There is no external vantage point from which the agent can survey or delimit the domain; even propositions about the domain itself become elements of it once formulated.

Determinacy. A set S is determinate for a finite agent A if the agent’s justificatory device can, in principle, deliver a definite, rule‑governed output for every element of S. If the justificatory device cannot settle every element of S, then S is indeterminate for A.

It is essential to emphasize that P is the universe of propositions available to the agent. Any proposition the agent can formulate is, by definition, an element of P. There is no meta-level outside of P from which the agent can describe or delimit the domain. Thus even propositions whose content concerns the totality or structure of P are themselves members of P once formulated. This motivates the following.

Domain‑Absorption Principle. Whenever an agent formulates a proposition whose content concerns the totality or structure of its own propositional domain, that very act places the proposition inside the domain it attempts to describe. Formally,

p concerns P implies p is a member of P

Any such proposition is immediately absorbed into the domain it refers to.

This framework establishes the structural tension at the heart of the endnote: formulation expands the domain, while justification operates within a fixed finitary procedure. The impossibility of metaphysical closure arises directly from this mismatch.

Remark.

The recursive‑propositional‑domain loop is activated only by propositions whose content concerns the totality or structure of the agent’s propositional domain P. Ordinary propositions—those not about P—do not trigger the loop, since their justification does not require the agent to describe or delimit the domain itself. However, any attempt to establish completeness or closure for a metaphysical system necessarily involves a proposition asserting the finality of P. Such propositions are immediately absorbed into the domain, and their justification generates further propositions of the same kind, expanding the domain in the very act of trying to close it. Thus the loop is selective in scope but unavoidable in precisely those contexts where closure is sought.

3. The Indeterminacy of the Propositional Domain

The following lemma can be understood as the first formal appearance of what I call the recursive‑propositional‑domain loop. Whenever a finite agent attempts to justify a proposition that claims to capture the complete structure of its propositional domain, the justificatory act itself generates a new proposition—one that necessarily concerns the domain and is therefore absorbed into it. The domain expands in the very moment the agent tries to close it. This recursive expansion is not an accident of language or an artifact of self‑reference; it is a structural feature of any system in which formulation is open‑ended but justification is finitary. The loop ensures that every attempt at metaphysical closure reopens the domain it sought to finalize, setting the stage for the indeterminacy result that follows.

Lemma: (Indeterminacy Lemma)

Let A be a finite agent. Then A cannot justify a proposition that fully captures the structure of its own propositional domain P, because the justificatory act itself generates a new proposition that expands that domain. Each attempt at closure triggers a;

recursive‑propositional‑domain loop,

ensuring that the domain remains indeterminate for the agent.

Proof

Let;

p(0) def=: [the formulation that purports to fully characterizes P.]

Suppose A formulates a proposition p(0). Then,

by the Domain‑Absorption Principle, p(0) is a member of P.

For p(0) to be justified, A must perform a justificatory act, which generates a further justificatory proposition p(1);

“the justification that p(0) really characterizes P,”

that, concerning the adequacy of p(0).

Again, by DAP, p(1) is a member of P.

so p(0) fails to describe the expanded domain the set‑theoretic union of P and {p(1)}.

Now let p(1) be advanced as a complete description of this new domain. Its justification generates a new proposition p(2), which is likewise absorbed into the domain, rendering p(1) incomplete. Proceeding inductively, for any n, justification of p(n) yields a new proposition p(n+1) that enlarges the domain beyond what p(n) describes. Thus no p(n) can be a complete, justified description of its own propositional domain. Therefore P is indeterminate for A.

And, hence, for any metaphysical system constructed by a finite agent, this is the best that can be hoped for, since no stronger claim can be justified without reopening the very domain the system attempts to complete.

QED

4. The Impossibility of Metaphysical Closure

Theorem (IMC)

Let A be a finite agent with propositional domain P. No metaphysical system M that A can formulate and justify can provide a complete and final description of reality. In particular, A cannot achieve metaphysical closure: there is no justified system M whose propositions exhaust all propositions the agent could, in principle, formulate and justify.

Proof. Any metaphysical system M available to A is a structured subset of P: its axioms, principles, and theorems are all propositions A can formulate and (purports to) justify. For M to deliver metaphysical closure, A must be able to justify that M completely captures the relevant domain—at minimum, the structure of P as the space of possible metaphysical claims.

But by the Indeterminacy Lemma, no finite agent A can justify a proposition that completely describes the structure of its own propositional domain P. Every such justificatory attempt triggers the recursive‑propositional‑domain loop and leaves the domain indeterminate for A. Therefore, A cannot justifiably claim that any metaphysical system M is complete or final. Hence metaphysical closure is impossible for finite agents.

QED

5. Implications for Philosophical Systems

The impossibility of metaphysical closure has direct consequences for any philosophical system that aims to provide a complete account of reality. Every such system presupposes a determinate propositional domain determinate for the agent: a fixed space of questions it can pose, distinctions it can draw, and claims it can justify. But for a finite agent, the propositional domain is structurally indeterminate. Any attempt to justify the completeness of a system inevitably generates new propositions that fall outside the system’s original scope. The system expands in the very act of trying to secure its own boundaries.

This result does not depend on the content of a metaphysical theory but on its form. Whether the system is rationalist, empiricist, idealist, physicalist, or formally axiomatized, closure requires a justified description of the total domain of possible propositions. The recursive‑propositional‑domain loop shows that no finite agent can supply such a justification. Thus every metaphysical system constructed by finite agents must remain open‑ended: extendable, revisable, and incapable of finality.

6. Conclusion: The Loop to Get Here

This journey or whatnot began with an innocent, though, mischievous look at the CTMU theory. It lead me here and there and everywhere. Imagine my letdown when I remembered from computer science of all things, a hack: the recursive‑subject email loop, in which each reply generates a new subject line that triggers yet another reply, producing a chain that expands faster than any single step can contain. What first appeared as a trivial glitch revealed a deeper structure—one in which every attempt at closure reopens the process that sought to end it. A sort of always and forever off by one error for metaphysical inquiry if you will.

And so, I reasoned, the impossibility of metaphysical closure for finite agents is the philosophical analogue of that loop. Whenever a finite agent attempts to justify a complete metaphysical system, the justificatory act itself introduces a new proposition into the agent’s propositional domain. By the Domain‑Absorption Principle, this new proposition becomes part of the very domain the system was meant to capture. The domain expands in the moment the agent tries to finalize it. The recursive‑propositional‑domain loop is therefore not a metaphor but the structural engine driving the impossibility theorem.

The disappointment that motivated this work—the recognition that no metaphysical system can be complete—turns out not to be a failure of method or imagination. It is a consequence of our position as finite agents whose justificatory acts are always overtaken by the open‑endedness of formulation. Metaphysics remains possible, but closure does not. The loop ensures that the horizon of inquiry always recedes, and that our systems, however ambitious, remain provisional orientations rather than final accounts.

“The impossibility of metaphysical closure arises from the minimal logical time built into reasoning: formulation must precede justification, and no universe containing agents can violate this order.”

6. Coda: On Admiring and Declining Grand Metaphysics

There is a long and remarkable tradition of thinkers who attempt to construct complete metaphysical systems—frameworks that claim to articulate the total structure of reality. Spinoza’s geometric monism, Descartes’s dualist architecture, Hegel’s dialectical totality, and contemporary systems such as Langan’s CTMU all share a common aspiration: to produce a final, closed account of what is. These projects require intellectual courage, conceptual ambition, and a willingness to follow an idea to its furthest possible limit. For that reason, I admire them. They represent philosophy at its most architectonic, its most imaginative, its most structurally daring.

But admiration is not the same as participation. The argument of this endnote explains why I myself cannot pursue such a project. Any metaphysical system that aims at completeness must include a proposition that purports to fully characterize the agent’s propositional domain. As shown by the recursive‑propositional‑domain loop, such a proposition cannot be justified by a finite agent without generating a new proposition that expands the domain beyond what the system claimed to capture. The very act of securing closure reopens the space of possible propositions. The system outruns itself in the moment it tries to finish.

This structural limitation is not a critique of the great metaphysical systems; it is a recognition of the conditions under which finite agents reason. Spinoza, Hegel, Descartes, and their modern successors are engaged in an extraordinary intellectual endeavor, but the completeness they seek is not available to beings whose justificatory acts are absorbed into and expand their own domains of thought. Their systems are magnificent precisely because they attempt what cannot, in the end, be completed.

For me, the impossibility of metaphysical closure is not a disappointment but a release. It marks the boundary of what a finite agent can justifiably claim, and it clarifies the kind of philosophical work I can pursue with integrity. I can analyze structures, expose limits, and clarify the conditions of inquiry, but I cannot construct a final metaphysical architecture. The horizon of thought recedes as we approach it, and the openness that results is not a failure of metaphysics but its proper condition.

This endnote is therefore both an end and a beginning: an end to the aspiration for closure, and a beginning of a more modest, structurally grounded metaphysics—one that acknowledges the beauty of grand systems while accepting that, for finite agents, the domain of possible thought is always larger than any system that seeks to contain it.

In the end;

A metaphysical system remains stable so long as its propositions concern only the world it seeks to describe. The difficulty arises only when the system attempts to characterize its own totality. For a finite agent, any such self‑describing proposition requires a justificatory act, and that act inevitably generates a further proposition that expands the domain beyond what the original claim purported to capture. This is the point at which the recursive‑propositional‑domain loop ignites: the system outruns itself precisely when it tries to close over itself.

Kenneth Myers

Appendix

--------------------------------------------------------------------------------
 RECURSIVE-PROPOSITIONAL-DOMAIN LOOP                  REPLY-BOMB SUBJECT LOOP
--------------------------------------------------------------------------------
 p(n)  --justify-->  p(n+1)                           s(n)  --reply-->  s(n+1)
   |                     |                               |                 |
   |                     v                               |                 v
   |              Domain expands                         |        Thread expands
   |              P → P ∪ {p(n+1)}                       |        S → S ∪ {s(n+1)}
   |                                                     |
   v                                                     v
 p(n+1) --justify--> p(n+2)                            s(n+1) --reply--> s(n+2)
   |                     |                               |                   |
   |                     v                               |                   v
   |              Domain expands                         |           Thread expands
   |                                                     |
   v                                                     v
 p(n+2) --justify--> p(n+3)...                         s(n+2) --reply--> s(n+3)...
--------------------------------------------------------------------------------
STRUCTURAL PARALLEL:
A fixed recursive rule generates new elements that must be absorbed into 

the system, causing unbounded expansion and preventing the system 

from closing over itself.
--------------------------------------------------------------------------------